18.82/8.71 YES 18.82/8.71 18.82/8.71 Ultimate: Cannot open display: 18.82/8.71 This is Ultimate 0.1.24-8dc7c08-m 18.82/8.71 [2019-03-28 12:49:59,150 INFO L170 SettingsManager]: Resetting all preferences to default values... 18.82/8.71 [2019-03-28 12:49:59,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 18.82/8.71 [2019-03-28 12:49:59,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 18.82/8.71 [2019-03-28 12:49:59,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 18.82/8.71 [2019-03-28 12:49:59,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 18.82/8.71 [2019-03-28 12:49:59,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 18.82/8.71 [2019-03-28 12:49:59,169 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 18.82/8.71 [2019-03-28 12:49:59,170 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 18.82/8.71 [2019-03-28 12:49:59,171 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,171 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 18.82/8.71 [2019-03-28 12:49:59,172 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 18.82/8.71 [2019-03-28 12:49:59,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 18.82/8.71 [2019-03-28 12:49:59,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 18.82/8.71 [2019-03-28 12:49:59,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 18.82/8.71 [2019-03-28 12:49:59,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 18.82/8.71 [2019-03-28 12:49:59,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 18.82/8.71 [2019-03-28 12:49:59,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 18.82/8.71 [2019-03-28 12:49:59,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 18.82/8.71 [2019-03-28 12:49:59,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 18.82/8.71 [2019-03-28 12:49:59,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 18.82/8.71 [2019-03-28 12:49:59,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 18.82/8.71 [2019-03-28 12:49:59,186 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 18.82/8.71 [2019-03-28 12:49:59,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 18.82/8.71 [2019-03-28 12:49:59,187 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 18.82/8.71 [2019-03-28 12:49:59,188 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 18.82/8.71 [2019-03-28 12:49:59,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 18.82/8.71 [2019-03-28 12:49:59,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 18.82/8.71 [2019-03-28 12:49:59,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 18.82/8.71 [2019-03-28 12:49:59,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 18.82/8.71 [2019-03-28 12:49:59,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 18.82/8.71 [2019-03-28 12:49:59,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 18.82/8.71 [2019-03-28 12:49:59,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 18.82/8.71 [2019-03-28 12:49:59,194 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 18.82/8.71 [2019-03-28 12:49:59,208 INFO L110 SettingsManager]: Loading preferences was successful 18.82/8.71 [2019-03-28 12:49:59,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 18.82/8.71 [2019-03-28 12:49:59,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 18.82/8.71 [2019-03-28 12:49:59,209 INFO L133 SettingsManager]: * Rewrite not-equals=true 18.82/8.71 [2019-03-28 12:49:59,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 18.82/8.71 [2019-03-28 12:49:59,210 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 18.82/8.71 [2019-03-28 12:49:59,210 INFO L133 SettingsManager]: * Use SBE=true 18.82/8.71 [2019-03-28 12:49:59,210 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 18.82/8.71 [2019-03-28 12:49:59,210 INFO L133 SettingsManager]: * Use old map elimination=false 18.82/8.71 [2019-03-28 12:49:59,210 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 18.82/8.71 [2019-03-28 12:49:59,211 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 18.82/8.71 [2019-03-28 12:49:59,211 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 18.82/8.71 [2019-03-28 12:49:59,211 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 18.82/8.71 [2019-03-28 12:49:59,211 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 18.82/8.71 [2019-03-28 12:49:59,211 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 18.82/8.71 [2019-03-28 12:49:59,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 18.82/8.71 [2019-03-28 12:49:59,212 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 18.82/8.71 [2019-03-28 12:49:59,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE 18.82/8.71 [2019-03-28 12:49:59,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 18.82/8.71 [2019-03-28 12:49:59,212 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 18.82/8.71 [2019-03-28 12:49:59,212 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 18.82/8.71 [2019-03-28 12:49:59,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 18.82/8.71 [2019-03-28 12:49:59,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 18.82/8.71 [2019-03-28 12:49:59,213 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 18.82/8.71 [2019-03-28 12:49:59,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.82/8.71 [2019-03-28 12:49:59,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 18.82/8.71 [2019-03-28 12:49:59,213 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 18.82/8.71 [2019-03-28 12:49:59,214 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 18.82/8.71 [2019-03-28 12:49:59,214 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 18.82/8.71 [2019-03-28 12:49:59,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 18.82/8.71 [2019-03-28 12:49:59,252 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 18.82/8.71 [2019-03-28 12:49:59,256 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 18.82/8.71 [2019-03-28 12:49:59,257 INFO L271 PluginConnector]: Initializing CDTParser... 18.82/8.71 [2019-03-28 12:49:59,258 INFO L276 PluginConnector]: CDTParser initialized 18.82/8.71 [2019-03-28 12:49:59,258 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 18.82/8.71 [2019-03-28 12:49:59,460 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/62e6c986535a4ee698bcf76f9ba8433c/FLAG319366687 18.82/8.71 [2019-03-28 12:49:59,810 INFO L307 CDTParser]: Found 1 translation units. 18.82/8.71 [2019-03-28 12:49:59,811 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 18.82/8.71 [2019-03-28 12:49:59,812 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 18.82/8.71 [2019-03-28 12:49:59,818 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/62e6c986535a4ee698bcf76f9ba8433c/FLAG319366687 18.82/8.71 [2019-03-28 12:50:00,214 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/62e6c986535a4ee698bcf76f9ba8433c 18.82/8.71 [2019-03-28 12:50:00,225 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 18.82/8.71 [2019-03-28 12:50:00,227 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 18.82/8.71 [2019-03-28 12:50:00,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 18.82/8.71 [2019-03-28 12:50:00,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 18.82/8.71 [2019-03-28 12:50:00,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 18.82/8.71 [2019-03-28 12:50:00,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391f5aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:00,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 18.82/8.71 [2019-03-28 12:50:00,261 INFO L176 MainTranslator]: Built tables and reachable declarations 18.82/8.71 [2019-03-28 12:50:00,425 INFO L206 PostProcessor]: Analyzing one entry point: main 18.82/8.71 [2019-03-28 12:50:00,438 INFO L191 MainTranslator]: Completed pre-run 18.82/8.71 [2019-03-28 12:50:00,519 INFO L206 PostProcessor]: Analyzing one entry point: main 18.82/8.71 [2019-03-28 12:50:00,536 INFO L195 MainTranslator]: Completed translation 18.82/8.71 [2019-03-28 12:50:00,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00 WrapperNode 18.82/8.71 [2019-03-28 12:50:00,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 18.82/8.71 [2019-03-28 12:50:00,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 18.82/8.71 [2019-03-28 12:50:00,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 18.82/8.71 [2019-03-28 12:50:00,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 18.82/8.71 [2019-03-28 12:50:00,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 18.82/8.71 [2019-03-28 12:50:00,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 18.82/8.71 [2019-03-28 12:50:00,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 18.82/8.71 [2019-03-28 12:50:00,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized 18.82/8.71 [2019-03-28 12:50:00,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 18.82/8.71 [2019-03-28 12:50:00,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 18.82/8.71 [2019-03-28 12:50:00,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... 18.82/8.71 [2019-03-28 12:50:00,605 INFO L276 PluginConnector]: RCFGBuilder initialized 18.82/8.71 [2019-03-28 12:50:00,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (1/1) ... 18.82/8.71 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 18.82/8.71 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 18.82/8.71 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 18.82/8.71 [2019-03-28 12:50:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 18.82/8.71 [2019-03-28 12:50:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 18.82/8.71 [2019-03-28 12:50:00,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 18.82/8.71 [2019-03-28 12:50:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 18.82/8.71 [2019-03-28 12:50:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 18.82/8.71 [2019-03-28 12:50:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 18.82/8.71 [2019-03-28 12:50:00,936 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 18.82/8.71 [2019-03-28 12:50:00,937 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 18.82/8.71 [2019-03-28 12:50:00,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:00 BoogieIcfgContainer 18.82/8.71 [2019-03-28 12:50:00,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 18.82/8.71 [2019-03-28 12:50:00,939 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 18.82/8.71 [2019-03-28 12:50:00,939 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 18.82/8.71 [2019-03-28 12:50:00,941 INFO L276 PluginConnector]: BlockEncodingV2 initialized 18.82/8.71 [2019-03-28 12:50:00,942 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:00" (1/1) ... 18.82/8.71 [2019-03-28 12:50:00,959 INFO L313 BlockEncoder]: Initial Icfg 41 locations, 43 edges 18.82/8.71 [2019-03-28 12:50:00,960 INFO L258 BlockEncoder]: Using Remove infeasible edges 18.82/8.71 [2019-03-28 12:50:00,961 INFO L263 BlockEncoder]: Using Maximize final states 18.82/8.71 [2019-03-28 12:50:00,962 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 18.82/8.71 [2019-03-28 12:50:00,962 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 18.82/8.71 [2019-03-28 12:50:00,964 INFO L296 BlockEncoder]: Using Remove sink states 18.82/8.71 [2019-03-28 12:50:00,964 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 18.82/8.71 [2019-03-28 12:50:00,965 INFO L179 BlockEncoder]: Using Rewrite not-equals 18.82/8.71 [2019-03-28 12:50:00,989 INFO L185 BlockEncoder]: Using Use SBE 18.82/8.71 [2019-03-28 12:50:01,024 INFO L200 BlockEncoder]: SBE split 21 edges 18.82/8.71 [2019-03-28 12:50:01,029 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 18.82/8.71 [2019-03-28 12:50:01,031 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.82/8.71 [2019-03-28 12:50:01,062 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 18.82/8.71 [2019-03-28 12:50:01,064 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 18.82/8.71 [2019-03-28 12:50:01,066 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 18.82/8.71 [2019-03-28 12:50:01,066 INFO L71 MaximizeFinalStates]: 0 new accepting states 18.82/8.71 [2019-03-28 12:50:01,067 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 18.82/8.71 [2019-03-28 12:50:01,067 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 18.82/8.71 [2019-03-28 12:50:01,068 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 58 edges 18.82/8.71 [2019-03-28 12:50:01,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:01 BasicIcfg 18.82/8.71 [2019-03-28 12:50:01,069 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 18.82/8.71 [2019-03-28 12:50:01,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 18.82/8.71 [2019-03-28 12:50:01,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... 18.82/8.71 [2019-03-28 12:50:01,074 INFO L276 PluginConnector]: TraceAbstraction initialized 18.82/8.71 [2019-03-28 12:50:01,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:50:00" (1/4) ... 18.82/8.71 [2019-03-28 12:50:01,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34936285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:01, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:01,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (2/4) ... 18.82/8.71 [2019-03-28 12:50:01,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34936285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:01, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:01,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:00" (3/4) ... 18.82/8.71 [2019-03-28 12:50:01,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34936285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:01, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:01,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:01" (4/4) ... 18.82/8.71 [2019-03-28 12:50:01,078 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.82/8.71 [2019-03-28 12:50:01,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 18.82/8.71 [2019-03-28 12:50:01,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. 18.82/8.71 [2019-03-28 12:50:01,113 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. 18.82/8.71 [2019-03-28 12:50:01,143 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.82/8.71 [2019-03-28 12:50:01,143 INFO L382 AbstractCegarLoop]: Interprodecural is true 18.82/8.71 [2019-03-28 12:50:01,144 INFO L383 AbstractCegarLoop]: Hoare is true 18.82/8.71 [2019-03-28 12:50:01,144 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 18.82/8.71 [2019-03-28 12:50:01,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 18.82/8.71 [2019-03-28 12:50:01,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.82/8.71 [2019-03-28 12:50:01,144 INFO L387 AbstractCegarLoop]: Difference is false 18.82/8.71 [2019-03-28 12:50:01,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 18.82/8.71 [2019-03-28 12:50:01,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 18.82/8.71 [2019-03-28 12:50:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. 18.82/8.71 [2019-03-28 12:50:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 18.82/8.71 [2019-03-28 12:50:01,166 INFO L394 BasicCegarLoop]: Found error trace 18.82/8.71 [2019-03-28 12:50:01,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 18.82/8.71 [2019-03-28 12:50:01,167 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 18.82/8.71 [2019-03-28 12:50:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash 116378, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:01,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:01,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:01,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:01,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.82/8.71 [2019-03-28 12:50:01,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.82/8.71 [2019-03-28 12:50:01,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.82/8.71 [2019-03-28 12:50:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.82/8.71 [2019-03-28 12:50:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,377 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. 18.82/8.71 [2019-03-28 12:50:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.82/8.71 [2019-03-28 12:50:01,537 INFO L93 Difference]: Finished difference Result 33 states and 58 transitions. 18.82/8.71 [2019-03-28 12:50:01,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 18.82/8.71 [2019-03-28 12:50:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.82/8.71 [2019-03-28 12:50:01,553 INFO L225 Difference]: With dead ends: 33 18.82/8.71 [2019-03-28 12:50:01,553 INFO L226 Difference]: Without dead ends: 28 18.82/8.71 [2019-03-28 12:50:01,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 18.82/8.71 [2019-03-28 12:50:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 18.82/8.71 [2019-03-28 12:50:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 18.82/8.71 [2019-03-28 12:50:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. 18.82/8.71 [2019-03-28 12:50:01,596 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 3 18.82/8.71 [2019-03-28 12:50:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. 18.82/8.71 [2019-03-28 12:50:01,598 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 48 transitions. 18.82/8.71 [2019-03-28 12:50:01,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. 18.82/8.71 [2019-03-28 12:50:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 18.82/8.71 [2019-03-28 12:50:01,599 INFO L394 BasicCegarLoop]: Found error trace 18.82/8.71 [2019-03-28 12:50:01,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 18.82/8.71 [2019-03-28 12:50:01,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 18.82/8.71 [2019-03-28 12:50:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash 116379, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:01,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:01,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:01,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:01,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.82/8.71 [2019-03-28 12:50:01,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.82/8.71 [2019-03-28 12:50:01,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.82/8.71 [2019-03-28 12:50:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.82/8.71 [2019-03-28 12:50:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,627 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. Second operand 3 states. 18.82/8.71 [2019-03-28 12:50:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.82/8.71 [2019-03-28 12:50:01,698 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. 18.82/8.71 [2019-03-28 12:50:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 18.82/8.71 [2019-03-28 12:50:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.82/8.71 [2019-03-28 12:50:01,700 INFO L225 Difference]: With dead ends: 33 18.82/8.71 [2019-03-28 12:50:01,700 INFO L226 Difference]: Without dead ends: 28 18.82/8.71 [2019-03-28 12:50:01,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 18.82/8.71 [2019-03-28 12:50:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 18.82/8.71 [2019-03-28 12:50:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 18.82/8.71 [2019-03-28 12:50:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. 18.82/8.71 [2019-03-28 12:50:01,706 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 3 18.82/8.71 [2019-03-28 12:50:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. 18.82/8.71 [2019-03-28 12:50:01,706 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. 18.82/8.71 [2019-03-28 12:50:01,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. 18.82/8.71 [2019-03-28 12:50:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 18.82/8.71 [2019-03-28 12:50:01,707 INFO L394 BasicCegarLoop]: Found error trace 18.82/8.71 [2019-03-28 12:50:01,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 18.82/8.71 [2019-03-28 12:50:01,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 18.82/8.71 [2019-03-28 12:50:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:01,707 INFO L82 PathProgramCache]: Analyzing trace with hash 116380, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:01,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:01,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:01,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.82/8.71 [2019-03-28 12:50:01,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.82/8.71 [2019-03-28 12:50:01,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.82/8.71 [2019-03-28 12:50:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.82/8.71 [2019-03-28 12:50:01,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,744 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 3 states. 18.82/8.71 [2019-03-28 12:50:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.82/8.71 [2019-03-28 12:50:01,817 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. 18.82/8.71 [2019-03-28 12:50:01,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 18.82/8.71 [2019-03-28 12:50:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.82/8.71 [2019-03-28 12:50:01,818 INFO L225 Difference]: With dead ends: 28 18.82/8.71 [2019-03-28 12:50:01,818 INFO L226 Difference]: Without dead ends: 22 18.82/8.71 [2019-03-28 12:50:01,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 18.82/8.71 [2019-03-28 12:50:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. 18.82/8.71 [2019-03-28 12:50:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 18.82/8.71 [2019-03-28 12:50:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. 18.82/8.71 [2019-03-28 12:50:01,823 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 3 18.82/8.71 [2019-03-28 12:50:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. 18.82/8.71 [2019-03-28 12:50:01,823 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. 18.82/8.71 [2019-03-28 12:50:01,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. 18.82/8.71 [2019-03-28 12:50:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 18.82/8.71 [2019-03-28 12:50:01,824 INFO L394 BasicCegarLoop]: Found error trace 18.82/8.71 [2019-03-28 12:50:01,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:01,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 18.82/8.71 [2019-03-28 12:50:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 3605865, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:01,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:01,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.82/8.71 [2019-03-28 12:50:01,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.82/8.71 [2019-03-28 12:50:01,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.82/8.71 [2019-03-28 12:50:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.82/8.71 [2019-03-28 12:50:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,856 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 3 states. 18.82/8.71 [2019-03-28 12:50:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.82/8.71 [2019-03-28 12:50:01,918 INFO L93 Difference]: Finished difference Result 22 states and 37 transitions. 18.82/8.71 [2019-03-28 12:50:01,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 18.82/8.71 [2019-03-28 12:50:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.82/8.71 [2019-03-28 12:50:01,920 INFO L225 Difference]: With dead ends: 22 18.82/8.71 [2019-03-28 12:50:01,920 INFO L226 Difference]: Without dead ends: 18 18.82/8.71 [2019-03-28 12:50:01,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 18.82/8.71 [2019-03-28 12:50:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 18.82/8.71 [2019-03-28 12:50:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 18.82/8.71 [2019-03-28 12:50:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. 18.82/8.71 [2019-03-28 12:50:01,924 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 4 18.82/8.71 [2019-03-28 12:50:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. 18.82/8.71 [2019-03-28 12:50:01,924 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. 18.82/8.71 [2019-03-28 12:50:01,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. 18.82/8.71 [2019-03-28 12:50:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 18.82/8.71 [2019-03-28 12:50:01,925 INFO L394 BasicCegarLoop]: Found error trace 18.82/8.71 [2019-03-28 12:50:01,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:01,925 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 18.82/8.71 [2019-03-28 12:50:01,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 3605867, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:01,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:01,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:01,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:01,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.82/8.71 [2019-03-28 12:50:01,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.82/8.71 [2019-03-28 12:50:01,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.82/8.71 [2019-03-28 12:50:01,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.82/8.71 [2019-03-28 12:50:01,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,955 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 3 states. 18.82/8.71 [2019-03-28 12:50:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.82/8.71 [2019-03-28 12:50:01,988 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. 18.82/8.71 [2019-03-28 12:50:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 18.82/8.71 [2019-03-28 12:50:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.82/8.71 [2019-03-28 12:50:01,989 INFO L225 Difference]: With dead ends: 22 18.82/8.71 [2019-03-28 12:50:01,989 INFO L226 Difference]: Without dead ends: 18 18.82/8.71 [2019-03-28 12:50:01,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 18.82/8.71 [2019-03-28 12:50:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 18.82/8.71 [2019-03-28 12:50:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 18.82/8.71 [2019-03-28 12:50:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. 18.82/8.71 [2019-03-28 12:50:01,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 4 18.82/8.71 [2019-03-28 12:50:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. 18.82/8.71 [2019-03-28 12:50:01,993 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. 18.82/8.71 [2019-03-28 12:50:01,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. 18.82/8.71 [2019-03-28 12:50:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 18.82/8.71 [2019-03-28 12:50:01,994 INFO L394 BasicCegarLoop]: Found error trace 18.82/8.71 [2019-03-28 12:50:01,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:01,994 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 18.82/8.71 [2019-03-28 12:50:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash 3605868, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:01,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:02,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.82/8.71 [2019-03-28 12:50:02,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 18.82/8.71 [2019-03-28 12:50:02,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 18.82/8.71 [2019-03-28 12:50:02,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.82/8.71 [2019-03-28 12:50:02,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:02,024 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 3 states. 18.82/8.71 [2019-03-28 12:50:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.82/8.71 [2019-03-28 12:50:02,064 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. 18.82/8.71 [2019-03-28 12:50:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:02,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 18.82/8.71 [2019-03-28 12:50:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 18.82/8.71 [2019-03-28 12:50:02,065 INFO L225 Difference]: With dead ends: 18 18.82/8.71 [2019-03-28 12:50:02,065 INFO L226 Difference]: Without dead ends: 0 18.82/8.71 [2019-03-28 12:50:02,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 18.82/8.71 [2019-03-28 12:50:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 18.82/8.71 [2019-03-28 12:50:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 18.82/8.71 [2019-03-28 12:50:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:02,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 18.82/8.71 [2019-03-28 12:50:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. 18.82/8.71 [2019-03-28 12:50:02,066 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:02,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:02,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 18.82/8.71 [2019-03-28 12:50:02,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:02,097 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,097 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,097 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,098 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,099 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point L12-4(line 12) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,101 INFO L448 ceAbstractionStarter]: For program point L12-6(lines 12 15) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,101 INFO L444 ceAbstractionStarter]: At program point L12-8(lines 12 15) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= ULTIMATE.start_test_fun_~tmp_ref~0.offset 0)) 18.82/8.71 [2019-03-28 12:50:02,101 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,102 INFO L448 ceAbstractionStarter]: For program point L12-9(lines 12 15) no Hoare annotation was computed. 18.82/8.71 [2019-03-28 12:50:02,102 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 18.82/8.71 [2019-03-28 12:50:02,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 [2019-03-28 12:50:02,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 [2019-03-28 12:50:02,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 [2019-03-28 12:50:02,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 [2019-03-28 12:50:02,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:02 BasicIcfg 18.82/8.71 [2019-03-28 12:50:02,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 18.82/8.71 [2019-03-28 12:50:02,121 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 18.82/8.71 [2019-03-28 12:50:02,121 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 18.82/8.71 [2019-03-28 12:50:02,124 INFO L276 PluginConnector]: BuchiAutomizer initialized 18.82/8.71 [2019-03-28 12:50:02,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.82/8.71 [2019-03-28 12:50:02,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:50:00" (1/5) ... 18.82/8.71 [2019-03-28 12:50:02,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5690b7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:02, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:02,126 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.82/8.71 [2019-03-28 12:50:02,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:00" (2/5) ... 18.82/8.71 [2019-03-28 12:50:02,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5690b7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:02, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:02,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.82/8.71 [2019-03-28 12:50:02,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:00" (3/5) ... 18.82/8.71 [2019-03-28 12:50:02,127 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5690b7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:02, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:02,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.82/8.71 [2019-03-28 12:50:02,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:01" (4/5) ... 18.82/8.71 [2019-03-28 12:50:02,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5690b7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:02, skipping insertion in model container 18.82/8.71 [2019-03-28 12:50:02,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 18.82/8.71 [2019-03-28 12:50:02,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:02" (5/5) ... 18.82/8.71 [2019-03-28 12:50:02,129 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 18.82/8.71 [2019-03-28 12:50:02,150 INFO L133 ementStrategyFactory]: Using default assertion order modulation 18.82/8.71 [2019-03-28 12:50:02,150 INFO L374 BuchiCegarLoop]: Interprodecural is true 18.82/8.71 [2019-03-28 12:50:02,150 INFO L375 BuchiCegarLoop]: Hoare is true 18.82/8.71 [2019-03-28 12:50:02,151 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 18.82/8.71 [2019-03-28 12:50:02,151 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 18.82/8.71 [2019-03-28 12:50:02,151 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 18.82/8.71 [2019-03-28 12:50:02,151 INFO L379 BuchiCegarLoop]: Difference is false 18.82/8.71 [2019-03-28 12:50:02,151 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 18.82/8.71 [2019-03-28 12:50:02,151 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 18.82/8.71 [2019-03-28 12:50:02,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 18.82/8.71 [2019-03-28 12:50:02,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 18.82/8.71 [2019-03-28 12:50:02,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.82/8.71 [2019-03-28 12:50:02,162 INFO L119 BuchiIsEmpty]: Starting construction of run 18.82/8.71 [2019-03-28 12:50:02,166 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:02,166 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:02,166 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 18.82/8.71 [2019-03-28 12:50:02,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 18.82/8.71 [2019-03-28 12:50:02,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 18.82/8.71 [2019-03-28 12:50:02,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.82/8.71 [2019-03-28 12:50:02,169 INFO L119 BuchiIsEmpty]: Starting construction of run 18.82/8.71 [2019-03-28 12:50:02,169 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:02,169 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:02,175 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [86] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 7#L-1true [126] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, ULTIMATE.start_test_fun_#t~nondet7, #length, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~nondet2, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11] 5#L9true [64] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 4#L9-1true [61] L9-1-->L10: Formula: (and (= (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_3|) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) 1)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 9#L10true [168] L10-->L12-8: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15 (store (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~nondet2_5|)) |v_#memory_int_15|) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_4|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~nondet2] 35#L12-8true 18.82/8.71 [2019-03-28 12:50:02,175 INFO L796 eck$LassoCheckResult]: Loop: 35#L12-8true [99] L12-8-->L12-1: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 12#L12-1true [147] L12-1-->L12-2: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short5_2|) (>= 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 10#L12-2true [73] L12-2-->L12-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short5_5|) InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_5|} AuxVars[] AssignedVars[] 19#L12-6true [81] L12-6-->L13: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 33#L13true [92] L13-->L13-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 29#L13-1true [171] L13-1-->L14: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (store |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20 (store (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_19|) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_20)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_20))) InVars {#valid=|v_#valid_32|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 16#L14true [174] L14-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 4) (select |v_#length_28| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 |v_ULTIMATE.start_test_fun_#t~nondet7_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_24|, #length=|v_#length_28|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_4|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~nondet7, #memory_int] 35#L12-8true 18.82/8.71 [2019-03-28 12:50:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash 111869186, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:02,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:02,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:02,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash -605196570, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:02,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:02,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:02,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:02,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 18.82/8.71 [2019-03-28 12:50:02,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 18.82/8.71 [2019-03-28 12:50:02,238 INFO L811 eck$LassoCheckResult]: loop already infeasible 18.82/8.71 [2019-03-28 12:50:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 18.82/8.71 [2019-03-28 12:50:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 18.82/8.71 [2019-03-28 12:50:02,240 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. 18.82/8.71 [2019-03-28 12:50:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 18.82/8.71 [2019-03-28 12:50:02,373 INFO L93 Difference]: Finished difference Result 35 states and 60 transitions. 18.82/8.71 [2019-03-28 12:50:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 18.82/8.71 [2019-03-28 12:50:02,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 60 transitions. 18.82/8.71 [2019-03-28 12:50:02,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 18.82/8.71 [2019-03-28 12:50:02,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 18.82/8.71 [2019-03-28 12:50:02,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 18.82/8.71 [2019-03-28 12:50:02,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.82/8.71 [2019-03-28 12:50:02,382 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 18.82/8.71 [2019-03-28 12:50:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 18.82/8.71 [2019-03-28 12:50:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,385 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,385 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,385 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 18.82/8.71 [2019-03-28 12:50:02,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. 18.82/8.71 [2019-03-28 12:50:02,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 18.82/8.71 [2019-03-28 12:50:02,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 18.82/8.71 [2019-03-28 12:50:02,386 INFO L119 BuchiIsEmpty]: Starting construction of run 18.82/8.71 [2019-03-28 12:50:02,387 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:02,387 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 18.82/8.71 [2019-03-28 12:50:02,388 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY [86] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 84#L-1 [126] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, ULTIMATE.start_test_fun_#t~nondet7, #length, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~short5, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~nondet2, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11] 82#L9 [64] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 79#L9-1 [61] L9-1-->L10: Formula: (and (= (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_3|) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) 1)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 80#L10 [168] L10-->L12-8: Formula: (and (= (store |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15 (store (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~nondet2_5|)) |v_#memory_int_15|) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_5|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_15, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_11, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_test_fun_#t~nondet2=|v_ULTIMATE.start_test_fun_#t~nondet2_4|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~nondet2] 85#L12-8 18.82/8.71 [2019-03-28 12:50:02,388 INFO L796 eck$LassoCheckResult]: Loop: 85#L12-8 [99] L12-8-->L12-1: Formula: (and (= (select |v_#valid_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 88#L12-1 [148] L12-1-->L12-2: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short5_2|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 86#L12-2 [72] L12-2-->L12-3: Formula: |v_ULTIMATE.start_test_fun_#t~short5_3| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} OutVars{ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_3|} AuxVars[] AssignedVars[] 83#L12-3 [83] L12-3-->L12-4: Formula: (and (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 81#L12-4 [153] L12-4-->L12-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short5_4| (= v_ULTIMATE.start_test_fun_~x_4 (* 2 |v_ULTIMATE.start_test_fun_#t~mem4_3|))) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_4} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_4|, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_4} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short5] 77#L12-6 [81] L12-6-->L13: Formula: |v_ULTIMATE.start_test_fun_#t~short5_9| InVars {ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~short5=|v_ULTIMATE.start_test_fun_#t~short5_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short5] 78#L13 [92] L13-->L13-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 89#L13-1 [171] L13-1-->L14: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_15) (= (store |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20 (store (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~x_ref~0.base_20) v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_19|) (= 1 (select |v_#valid_32| v_ULTIMATE.start_test_fun_~x_ref~0.base_20)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~x_ref~0.base_20))) InVars {#valid=|v_#valid_32|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{#valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_15, #length=|v_#length_25|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_20, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 90#L14 [174] L14-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 4) (select |v_#length_28| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12 |v_ULTIMATE.start_test_fun_#t~nondet7_5|)) |v_#memory_int_23|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_24|, #length=|v_#length_28|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_16, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_12, ULTIMATE.start_test_fun_#t~nondet7=|v_ULTIMATE.start_test_fun_#t~nondet7_4|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~nondet7, #memory_int] 85#L12-8 18.82/8.71 [2019-03-28 12:50:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:02,389 INFO L82 PathProgramCache]: Analyzing trace with hash 111869186, now seen corresponding path program 2 times 18.82/8.71 [2019-03-28 12:50:02,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:02,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:02,415 INFO L82 PathProgramCache]: Analyzing trace with hash -807173590, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:02,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:02,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash 831428169, now seen corresponding path program 1 times 18.82/8.71 [2019-03-28 12:50:02,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 18.82/8.71 [2019-03-28 12:50:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 18.82/8.71 [2019-03-28 12:50:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 18.82/8.71 [2019-03-28 12:50:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:02,831 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 18.82/8.71 [2019-03-28 12:50:02,942 INFO L216 LassoAnalysis]: Preferences: 18.82/8.71 [2019-03-28 12:50:02,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 18.82/8.71 [2019-03-28 12:50:02,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 18.82/8.71 [2019-03-28 12:50:02,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 18.82/8.71 [2019-03-28 12:50:02,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false 18.82/8.71 [2019-03-28 12:50:02,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 18.82/8.71 [2019-03-28 12:50:02,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 18.82/8.71 [2019-03-28 12:50:02,944 INFO L130 ssoRankerPreferences]: Path of dumped script: 18.82/8.71 [2019-03-28 12:50:02,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 18.82/8.71 [2019-03-28 12:50:02,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 18.82/8.71 [2019-03-28 12:50:02,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 18.82/8.71 [2019-03-28 12:50:02,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:02,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:02,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:02,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:02,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:02,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,171 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 18.82/8.71 [2019-03-28 12:50:03,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 18.82/8.71 [2019-03-28 12:50:03,590 INFO L300 LassoAnalysis]: Preprocessing complete. 18.82/8.71 [2019-03-28 12:50:03,596 INFO L497 LassoAnalysis]: Using template 'affine'. 18.82/8.71 [2019-03-28 12:50:03,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.82/8.71 [2019-03-28 12:50:03,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.82/8.71 [2019-03-28 12:50:03,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.82/8.71 [2019-03-28 12:50:03,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.82/8.71 [2019-03-28 12:50:03,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.82/8.71 [2019-03-28 12:50:03,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 18.82/8.71 [2019-03-28 12:50:03,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.82/8.71 [2019-03-28 12:50:03,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.82/8.71 [2019-03-28 12:50:03,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.82/8.71 [2019-03-28 12:50:03,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 18.82/8.71 [2019-03-28 12:50:03,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 18.82/8.71 Termination analysis: LINEAR_WITH_GUESSES 18.82/8.71 Number of strict supporting invariants: 0 18.82/8.71 Number of non-strict supporting invariants: 1 18.82/8.71 Consider only non-deceasing supporting invariants: true 18.82/8.71 Simplify termination arguments: true 18.82/8.71 Simplify supporting invariants: trueOverapproximate stem: false 18.82/8.71 [2019-03-28 12:50:03,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. 18.82/8.71 [2019-03-28 12:50:03,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 18.82/8.71 [2019-03-28 12:50:03,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 18.82/8.71 [2019-03-28 12:50:03,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 18.82/8.71 [2019-03-28 12:50:03,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 18.82/8.71 [2019-03-28 12:50:03,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 18.82/8.71 [2019-03-28 12:50:03,691 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 18.82/8.71 [2019-03-28 12:50:03,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 18.82/8.71 [2019-03-28 12:50:03,701 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 18.82/8.71 [2019-03-28 12:50:03,704 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 18.82/8.71 [2019-03-28 12:50:03,705 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 18.82/8.71 [2019-03-28 12:50:03,706 INFO L518 LassoAnalysis]: Proved termination. 18.82/8.71 [2019-03-28 12:50:03,706 INFO L520 LassoAnalysis]: Termination argument consisting of: 18.82/8.71 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 18.82/8.71 Supporting invariants [] 18.82/8.71 [2019-03-28 12:50:03,738 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed 18.82/8.71 [2019-03-28 12:50:03,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 18.82/8.71 [2019-03-28 12:50:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 18.82/8.71 [2019-03-28 12:50:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:03,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core 18.82/8.71 [2019-03-28 12:50:03,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.82/8.71 [2019-03-28 12:50:03,820 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 18.82/8.71 [2019-03-28 12:50:03,821 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:03,825 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 18.82/8.71 [2019-03-28 12:50:03,826 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:03,826 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 18.82/8.71 [2019-03-28 12:50:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:03,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core 18.82/8.71 [2019-03-28 12:50:03,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.82/8.71 [2019-03-28 12:50:03,902 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 18.82/8.71 [2019-03-28 12:50:03,903 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:03,913 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 18.82/8.71 [2019-03-28 12:50:03,914 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:03,914 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 18.82/8.71 [2019-03-28 12:50:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 18.82/8.71 [2019-03-28 12:50:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:04,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core 18.82/8.71 [2019-03-28 12:50:04,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.82/8.71 [2019-03-28 12:50:04,056 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 18.82/8.71 [2019-03-28 12:50:04,057 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:04,066 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 18.82/8.71 [2019-03-28 12:50:04,067 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:04,067 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 18.82/8.71 [2019-03-28 12:50:04,100 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 18.82/8.71 [2019-03-28 12:50:04,101 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:04,108 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 18.82/8.71 [2019-03-28 12:50:04,109 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:04,109 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 18.82/8.71 [2019-03-28 12:50:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 18.82/8.71 [2019-03-28 12:50:04,166 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 18.82/8.71 [2019-03-28 12:50:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 18.82/8.71 [2019-03-28 12:50:04,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core 18.82/8.71 [2019-03-28 12:50:04,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... 18.82/8.71 [2019-03-28 12:50:04,181 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 18.82/8.71 [2019-03-28 12:50:04,182 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:04,188 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 18.82/8.71 [2019-03-28 12:50:04,189 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 18.82/8.71 [2019-03-28 12:50:04,189 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 18.82/8.71 [2019-03-28 12:50:04,198 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 18.82/8.71 [2019-03-28 12:50:04,202 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates 18.82/8.71 [2019-03-28 12:50:04,203 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. 18.82/8.71 [2019-03-28 12:50:04,361 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 24 states and 28 transitions. Complement of second has 13 states. 18.82/8.71 [2019-03-28 12:50:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states 18.82/8.71 [2019-03-28 12:50:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 18.82/8.71 [2019-03-28 12:50:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. 18.82/8.71 [2019-03-28 12:50:04,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 9 letters. 18.82/8.71 [2019-03-28 12:50:04,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.82/8.71 [2019-03-28 12:50:04,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 14 letters. Loop has 9 letters. 18.82/8.71 [2019-03-28 12:50:04,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.82/8.71 [2019-03-28 12:50:04,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 18 letters. 18.82/8.71 [2019-03-28 12:50:04,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. 18.82/8.71 [2019-03-28 12:50:04,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. 18.82/8.71 [2019-03-28 12:50:04,374 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.82/8.71 [2019-03-28 12:50:04,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:04,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 18.82/8.71 [2019-03-28 12:50:04,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 18.82/8.71 [2019-03-28 12:50:04,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:04,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 18.82/8.71 [2019-03-28 12:50:04,375 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:04,375 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:04,375 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:04,375 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 18.82/8.71 [2019-03-28 12:50:04,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 18.82/8.71 [2019-03-28 12:50:04,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 18.82/8.71 [2019-03-28 12:50:04,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 18.82/8.71 [2019-03-28 12:50:04,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:04 BasicIcfg 18.82/8.71 [2019-03-28 12:50:04,381 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 18.82/8.71 [2019-03-28 12:50:04,382 INFO L168 Benchmark]: Toolchain (without parser) took 4155.56 ms. Allocated memory was 649.6 MB in the beginning and 747.1 MB in the end (delta: 97.5 MB). Free memory was 559.3 MB in the beginning and 468.9 MB in the end (delta: 90.4 MB). Peak memory consumption was 187.9 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,382 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.79 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 559.3 MB in the beginning and 639.9 MB in the end (delta: -80.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.89 ms. Allocated memory is still 673.2 MB. Free memory was 639.9 MB in the beginning and 636.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,384 INFO L168 Benchmark]: Boogie Preprocessor took 24.15 ms. Allocated memory is still 673.2 MB. Free memory was 636.0 MB in the beginning and 634.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,385 INFO L168 Benchmark]: RCFGBuilder took 333.44 ms. Allocated memory is still 673.2 MB. Free memory was 634.9 MB in the beginning and 612.8 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,385 INFO L168 Benchmark]: BlockEncodingV2 took 130.00 ms. Allocated memory is still 673.2 MB. Free memory was 612.8 MB in the beginning and 603.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,386 INFO L168 Benchmark]: TraceAbstraction took 1050.99 ms. Allocated memory is still 673.2 MB. Free memory was 602.0 MB in the beginning and 497.3 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,386 INFO L168 Benchmark]: BuchiAutomizer took 2260.10 ms. Allocated memory was 673.2 MB in the beginning and 747.1 MB in the end (delta: 73.9 MB). Free memory was 497.3 MB in the beginning and 468.9 MB in the end (delta: 28.4 MB). Peak memory consumption was 102.3 MB. Max. memory is 50.3 GB. 18.82/8.71 [2019-03-28 12:50:04,390 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 18.82/8.71 --- Results --- 18.82/8.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 18.82/8.71 - StatisticsResult: Initial Icfg 18.82/8.71 41 locations, 43 edges 18.82/8.71 - StatisticsResult: Encoded RCFG 18.82/8.71 33 locations, 58 edges 18.82/8.71 * Results from de.uni_freiburg.informatik.ultimate.core: 18.82/8.71 - StatisticsResult: Toolchain Benchmarks 18.82/8.71 Benchmark results are: 18.82/8.71 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 18.82/8.71 * CACSL2BoogieTranslator took 308.79 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 559.3 MB in the beginning and 639.9 MB in the end (delta: -80.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 18.82/8.71 * Boogie Procedure Inliner took 42.89 ms. Allocated memory is still 673.2 MB. Free memory was 639.9 MB in the beginning and 636.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 18.82/8.71 * Boogie Preprocessor took 24.15 ms. Allocated memory is still 673.2 MB. Free memory was 636.0 MB in the beginning and 634.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 18.82/8.71 * RCFGBuilder took 333.44 ms. Allocated memory is still 673.2 MB. Free memory was 634.9 MB in the beginning and 612.8 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 18.82/8.71 * BlockEncodingV2 took 130.00 ms. Allocated memory is still 673.2 MB. Free memory was 612.8 MB in the beginning and 603.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. 18.82/8.71 * TraceAbstraction took 1050.99 ms. Allocated memory is still 673.2 MB. Free memory was 602.0 MB in the beginning and 497.3 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 50.3 GB. 18.82/8.71 * BuchiAutomizer took 2260.10 ms. Allocated memory was 673.2 MB in the beginning and 747.1 MB in the end (delta: 73.9 MB). Free memory was 497.3 MB in the beginning and 468.9 MB in the end (delta: 28.4 MB). Peak memory consumption was 102.3 MB. Max. memory is 50.3 GB. 18.82/8.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 18.82/8.71 - GenericResult: Unfinished Backtranslation 18.82/8.71 unknown boogie variable #length 18.82/8.71 - GenericResult: Unfinished Backtranslation 18.82/8.71 unknown boogie variable #length 18.82/8.71 - GenericResult: Unfinished Backtranslation 18.82/8.71 unknown boogie variable #length 18.82/8.71 - GenericResult: Unfinished Backtranslation 18.82/8.71 unknown boogie variable #length 18.82/8.71 - GenericResult: Unfinished Backtranslation 18.82/8.71 unknown boogie variable #memory_int 18.82/8.71 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 18.82/8.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 13]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 9]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 13]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 13]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 9]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 10]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 13]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 10]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 14]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 11]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 14]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 16]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 11]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - PositiveResult [Line: 12]: pointer dereference always succeeds 18.82/8.71 For all program executions holds that pointer dereference always succeeds at this location 18.82/8.71 - AllSpecificationsHoldResult: All specifications hold 18.82/8.71 18 specifications checked. All of them hold 18.82/8.71 - InvariantResult [Line: 12]: Loop Invariant 18.82/8.71 [2019-03-28 12:50:04,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 [2019-03-28 12:50:04,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 [2019-03-28 12:50:04,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 [2019-03-28 12:50:04,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 18.82/8.71 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && x_ref == 0) && 1 == \valid[tmp_ref]) && 1 == \valid[x_ref]) && 4 == unknown-#length-unknown[tmp_ref]) && tmp_ref == 0 18.82/8.71 - StatisticsResult: Ultimate Automizer benchmark data 18.82/8.71 CFG has 1 procedures, 33 locations, 18 error locations. SAFE Result, 0.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 171 SDslu, 4 SDs, 0 SdLazy, 171 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 18.82/8.71 - StatisticsResult: Constructed decomposition of program 18.82/8.71 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 18.82/8.71 - StatisticsResult: Timing statistics 18.82/8.71 BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 16 SDtfs, 57 SDslu, 55 SDs, 0 SdLazy, 143 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax100 hnf100 lsp93 ukn64 mio100 lsp38 div100 bol100 ite100 ukn100 eq172 hnf89 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 18.82/8.72 - TerminationAnalysisResult: Termination proven 18.82/8.72 Buchi Automizer proved that your program is terminating 18.82/8.72 RESULT: Ultimate proved your program to be correct! 18.82/8.72 !SESSION 2019-03-28 12:49:56.795 ----------------------------------------------- 18.82/8.72 eclipse.buildId=unknown 18.82/8.72 java.version=1.8.0_181 18.82/8.72 java.vendor=Oracle Corporation 18.82/8.72 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 18.82/8.72 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.82/8.72 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 18.82/8.72 18.82/8.72 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:50:04.625 18.82/8.72 !MESSAGE The workspace will exit with unsaved changes in this session. 18.82/8.72 Received shutdown request... 18.82/8.72 Ultimate: 18.82/8.72 GTK+ Version Check 18.82/8.72 EOF