java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/nec40_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:22,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:22,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:22,433 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:22,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:22,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:22,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:22,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:22,443 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:22,444 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:22,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:22,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:22,453 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:22,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:22,458 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:22,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:22,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:22,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:22,467 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:22,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:22,471 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:22,472 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:22,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:22,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:22,477 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:22,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:22,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:22,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:22,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:22,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:22,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:22,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:22,488 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:22,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:22,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:22,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:22,492 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:04:22,520 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:22,520 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:22,524 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:22,524 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:22,527 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:22,528 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:22,528 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:22,528 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:22,528 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:22,528 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:22,529 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:22,529 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:22,529 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:22,529 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:22,529 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:22,529 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:22,530 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:22,531 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:22,531 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:22,531 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:22,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:22,531 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:22,532 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:22,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:22,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:22,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:22,532 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:22,534 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:22,534 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:22,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:22,534 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:22,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:22,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:22,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:22,619 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:22,620 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:22,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec40_true-unreach-call_true-termination.i [2018-11-23 13:04:22,699 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559d2bc16/5776ce2feeb243b4a900afbca13a6617/FLAG512e03258 [2018-11-23 13:04:23,158 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:23,159 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec40_true-unreach-call_true-termination.i [2018-11-23 13:04:23,165 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559d2bc16/5776ce2feeb243b4a900afbca13a6617/FLAG512e03258 [2018-11-23 13:04:23,654 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559d2bc16/5776ce2feeb243b4a900afbca13a6617 [2018-11-23 13:04:23,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:23,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:23,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:23,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:23,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:23,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:23" (1/1) ... [2018-11-23 13:04:23,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089b30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:23, skipping insertion in model container [2018-11-23 13:04:23,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:23" (1/1) ... [2018-11-23 13:04:23,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:23,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:23,981 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:24,015 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:24,042 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:24,102 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:24,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24 WrapperNode [2018-11-23 13:04:24,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:24,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:24,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:24,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:24,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:24,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:24,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:24,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:24,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... [2018-11-23 13:04:24,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:24,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:24,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:24,324 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:24,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:24,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:04:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:25,207 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:25,208 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:25,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:25 BoogieIcfgContainer [2018-11-23 13:04:25,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:25,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:25,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:25,213 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:25,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:23" (1/3) ... [2018-11-23 13:04:25,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bd9b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:25, skipping insertion in model container [2018-11-23 13:04:25,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:24" (2/3) ... [2018-11-23 13:04:25,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56bd9b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:25, skipping insertion in model container [2018-11-23 13:04:25,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:25" (3/3) ... [2018-11-23 13:04:25,217 INFO L112 eAbstractionObserver]: Analyzing ICFG nec40_true-unreach-call_true-termination.i [2018-11-23 13:04:25,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:25,234 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:25,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:25,285 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:25,286 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:25,286 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:25,286 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:25,286 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:25,287 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:25,287 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:25,287 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:25,287 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 13:04:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:04:25,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:25,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:25,315 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:25,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash -91485938, now seen corresponding path program 1 times [2018-11-23 13:04:25,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:25,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:25,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:25,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 13:04:25,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 1 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 2 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 3 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 4 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 5 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 6 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 7 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 8 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 9 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 10 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 11 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 12 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 13 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 14 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 15 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 16 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 17 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 18 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 19 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 20 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 21 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 22 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 23 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 24 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 25 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 26 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 27 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 28 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 29 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 30 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 31 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 32 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 33 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 34 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 35 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 36 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 37 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 38 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 39 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 40 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 41 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 42 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 43 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 44 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 45 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 46 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 47 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 48 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 49 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 50 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 51 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 52 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 53 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 54 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 55 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 56 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 57 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 58 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 59 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 60 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 61 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 62 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 63 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 64 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 65 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 66 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 67 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 68 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 69 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 70 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 71 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 72 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 73 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 74 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 75 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 76 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 77 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 78 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 79 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 80 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 81 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 82 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 83 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 84 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 85 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 86 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 87 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 88 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 89 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 90 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 91 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 92 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 93 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 94 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 95 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 96 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 97 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 98 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 99 + ~#x~0.offset, 1);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#y~0.base, ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 1 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 2 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 3 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 4 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 5 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 6 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 7 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 8 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 9 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 10 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 11 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 12 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 13 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 14 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 15 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 16 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 17 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 18 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 19 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 20 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 21 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 22 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 23 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 24 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 25 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 26 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 27 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 28 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 29 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 30 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 31 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 32 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 33 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 34 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 35 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 36 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 37 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 38 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 39 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 40 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 41 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 42 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 43 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 44 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 45 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 46 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 47 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 48 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 49 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 50 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 51 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 52 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 53 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 54 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 55 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 56 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 57 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 58 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 59 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 60 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 61 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 62 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 63 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 64 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 65 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 66 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 67 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 68 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 69 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 70 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 71 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 72 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 73 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 74 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 75 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 76 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 77 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 78 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 79 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 80 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 81 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 82 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 83 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 84 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 85 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 86 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 87 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 88 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 89 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 90 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 91 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 92 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 93 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 94 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 95 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 96 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 97 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 98 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 99 + ~#y~0.offset, 1);~i~0 := 0;~j~0 := 0;~k~0 := 0; {26#true} is VALID [2018-11-23 13:04:25,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 13:04:25,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #47#return; {26#true} is VALID [2018-11-23 13:04:25,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2018-11-23 13:04:25,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {26#true} is VALID [2018-11-23 13:04:25,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 13:04:25,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {27#false} is VALID [2018-11-23 13:04:25,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {27#false} is VALID [2018-11-23 13:04:25,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 != #t~mem4;havoc #t~mem4; {27#false} is VALID [2018-11-23 13:04:25,705 INFO L256 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert(0); {27#false} is VALID [2018-11-23 13:04:25,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 13:04:25,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2018-11-23 13:04:25,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 13:04:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:25,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:25,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:25,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:04:25,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:25,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:25,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:25,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:25,870 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 13:04:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:26,324 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 13:04:26,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:26,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:04:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 13:04:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 13:04:26,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2018-11-23 13:04:26,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:26,538 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:04:26,538 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:04:26,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:04:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:04:26,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:26,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:26,581 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:26,581 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:26,585 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:26,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:26,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:26,587 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:26,587 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:26,590 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:26,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:26,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:26,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:26,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:04:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:04:26,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:04:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:26,595 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:04:26,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:04:26,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:26,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:26,597 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:26,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:26,598 INFO L82 PathProgramCache]: Analyzing trace with hash 883179888, now seen corresponding path program 1 times [2018-11-23 13:04:26,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:26,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:26,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:26,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:26,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:26,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-23 13:04:26,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 1 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 2 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 3 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 4 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 5 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 6 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 7 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 8 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 9 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 10 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 11 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 12 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 13 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 14 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 15 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 16 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 17 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 18 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 19 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 20 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 21 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 22 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 23 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 24 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 25 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 26 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 27 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 28 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 29 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 30 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 31 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 32 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 33 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 34 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 35 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 36 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 37 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 38 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 39 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 40 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 41 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 42 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 43 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 44 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 45 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 46 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 47 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 48 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 49 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 50 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 51 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 52 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 53 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 54 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 55 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 56 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 57 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 58 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 59 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 60 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 61 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 62 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 63 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 64 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 65 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 66 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 67 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 68 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 69 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 70 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 71 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 72 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 73 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 74 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 75 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 76 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 77 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 78 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 79 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 80 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 81 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 82 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 83 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 84 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 85 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 86 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 87 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 88 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 89 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 90 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 91 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 92 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 93 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 94 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 95 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 96 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 97 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 98 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 99 + ~#x~0.offset, 1);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#y~0.base, ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 1 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 2 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 3 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 4 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 5 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 6 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 7 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 8 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 9 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 10 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 11 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 12 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 13 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 14 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 15 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 16 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 17 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 18 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 19 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 20 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 21 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 22 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 23 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 24 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 25 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 26 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 27 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 28 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 29 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 30 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 31 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 32 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 33 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 34 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 35 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 36 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 37 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 38 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 39 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 40 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 41 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 42 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 43 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 44 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 45 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 46 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 47 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 48 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 49 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 50 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 51 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 52 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 53 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 54 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 55 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 56 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 57 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 58 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 59 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 60 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 61 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 62 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 63 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 64 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 65 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 66 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 67 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 68 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 69 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 70 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 71 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 72 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 73 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 74 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 75 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 76 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 77 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 78 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 79 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 80 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 81 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 82 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 83 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 84 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 85 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 86 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 87 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 88 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 89 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 90 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 91 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 92 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 93 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 94 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 95 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 96 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 97 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 98 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 99 + ~#y~0.offset, 1);~i~0 := 0;~j~0 := 0;~k~0 := 0; {132#true} is VALID [2018-11-23 13:04:26,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-23 13:04:26,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #47#return; {132#true} is VALID [2018-11-23 13:04:26,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret5 := main(); {132#true} is VALID [2018-11-23 13:04:26,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {134#(= ~i~0 0)} is VALID [2018-11-23 13:04:26,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {134#(= ~i~0 0)} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {134#(= ~i~0 0)} is VALID [2018-11-23 13:04:26,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {134#(= ~i~0 0)} assume !(0 != #t~mem1);havoc #t~mem1; {134#(= ~i~0 0)} is VALID [2018-11-23 13:04:26,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {134#(= ~i~0 0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {134#(= ~i~0 0)} is VALID [2018-11-23 13:04:26,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#(= ~i~0 0)} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {133#false} is VALID [2018-11-23 13:04:26,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {133#false} assume 0 != #t~mem4;havoc #t~mem4; {133#false} is VALID [2018-11-23 13:04:26,830 INFO L256 TraceCheckUtils]: 11: Hoare triple {133#false} call __VERIFIER_assert(0); {133#false} is VALID [2018-11-23 13:04:26,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {133#false} ~cond := #in~cond; {133#false} is VALID [2018-11-23 13:04:26,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {133#false} assume 0 == ~cond; {133#false} is VALID [2018-11-23 13:04:26,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-23 13:04:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:26,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:26,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:26,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 13:04:26,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:26,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:26,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:26,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:26,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:26,906 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-23 13:04:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:27,084 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:04:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:27,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 13:04:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 13:04:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-23 13:04:27,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-23 13:04:27,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:27,249 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:04:27,249 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:04:27,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:04:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:04:27,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:27,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:27,267 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:27,268 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:27,270 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:27,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:27,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:27,271 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:27,271 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:27,273 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:27,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:27,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:27,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:27,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:04:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:04:27,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 13:04:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:27,277 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:04:27,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:04:27,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:27,278 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:27,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:27,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash 975532875, now seen corresponding path program 1 times [2018-11-23 13:04:27,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:27,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:27,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:27,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:27,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:27,983 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 14 [2018-11-23 13:04:28,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {235#true} is VALID [2018-11-23 13:04:28,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 1 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 2 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 3 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 4 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 5 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 6 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 7 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 8 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 9 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 10 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 11 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 12 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 13 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 14 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 15 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 16 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 17 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 18 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 19 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 20 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 21 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 22 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 23 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 24 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 25 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 26 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 27 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 28 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 29 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 30 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 31 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 32 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 33 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 34 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 35 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 36 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 37 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 38 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 39 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 40 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 41 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 42 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 43 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 44 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 45 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 46 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 47 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 48 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 49 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 50 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 51 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 52 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 53 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 54 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 55 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 56 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 57 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 58 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 59 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 60 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 61 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 62 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 63 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 64 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 65 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 66 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 67 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 68 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 69 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 70 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 71 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 72 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 73 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 74 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 75 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 76 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 77 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 78 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 79 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 80 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 81 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 82 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 83 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 84 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 85 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 86 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 87 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 88 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 89 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 90 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 91 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 92 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 93 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 94 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 95 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 96 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 97 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 98 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 99 + ~#x~0.offset, 1);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#y~0.base, ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 1 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 2 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 3 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 4 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 5 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 6 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 7 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 8 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 9 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 10 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 11 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 12 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 13 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 14 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 15 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 16 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 17 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 18 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 19 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 20 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 21 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 22 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 23 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 24 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 25 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 26 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 27 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 28 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 29 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 30 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 31 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 32 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 33 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 34 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 35 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 36 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 37 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 38 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 39 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 40 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 41 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 42 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 43 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 44 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 45 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 46 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 47 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 48 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 49 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 50 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 51 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 52 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 53 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 54 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 55 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 56 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 57 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 58 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 59 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 60 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 61 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 62 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 63 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 64 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 65 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 66 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 67 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 68 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 69 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 70 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 71 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 72 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 73 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 74 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 75 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 76 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 77 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 78 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 79 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 80 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 81 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 82 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 83 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 84 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 85 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 86 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 87 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 88 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 89 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 90 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 91 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 92 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 93 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 94 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 95 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 96 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 97 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 98 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 99 + ~#y~0.offset, 1);~i~0 := 0;~j~0 := 0;~k~0 := 0; {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} assume true; {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} {235#true} #47#return; {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} call #t~ret5 := main(); {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {238#(and (= ~i~0 0) (<= 0 |~#x~0.offset|) (<= |~#x~0.offset| 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))} is VALID [2018-11-23 13:04:28,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {238#(and (= ~i~0 0) (<= 0 |~#x~0.offset|) (<= |~#x~0.offset| 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {239#(and (= ~i~0 0) (= |main_#t~mem1| 0) (<= 0 |~#x~0.offset|) (<= |~#x~0.offset| 0))} is VALID [2018-11-23 13:04:28,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(and (= ~i~0 0) (= |main_#t~mem1| 0) (<= 0 |~#x~0.offset|) (<= |~#x~0.offset| 0))} assume !!(0 != #t~mem1);havoc #t~mem1;call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc #t~mem2;#t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {240#(<= ~i~0 0)} is VALID [2018-11-23 13:04:28,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(<= ~i~0 0)} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {240#(<= ~i~0 0)} is VALID [2018-11-23 13:04:28,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {240#(<= ~i~0 0)} assume !(0 != #t~mem1);havoc #t~mem1; {240#(<= ~i~0 0)} is VALID [2018-11-23 13:04:28,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {240#(<= ~i~0 0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {240#(<= ~i~0 0)} is VALID [2018-11-23 13:04:28,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {240#(<= ~i~0 0)} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {236#false} is VALID [2018-11-23 13:04:28,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {236#false} assume 0 != #t~mem4;havoc #t~mem4; {236#false} is VALID [2018-11-23 13:04:28,159 INFO L256 TraceCheckUtils]: 13: Hoare triple {236#false} call __VERIFIER_assert(0); {236#false} is VALID [2018-11-23 13:04:28,160 INFO L273 TraceCheckUtils]: 14: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2018-11-23 13:04:28,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2018-11-23 13:04:28,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {236#false} assume !false; {236#false} is VALID [2018-11-23 13:04:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:28,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:28,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:28,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:28,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-11-23 13:04:28,658 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:04:28,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:28,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:28,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:28,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-23 13:04:28,692 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:28,693 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |~#x~0.base|, |~#x~0.offset|]. (let ((.cse0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|))) (and (<= 0 |~#x~0.offset|) (= |main_#t~mem1| .cse0) (<= |~#x~0.offset| 0) (= 0 .cse0))) [2018-11-23 13:04:28,693 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem1|) [2018-11-23 13:04:28,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {235#true} call ULTIMATE.init(); {235#true} is VALID [2018-11-23 13:04:28,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {235#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#x~0.base, ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 1 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 2 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 3 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 4 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 5 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 6 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 7 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 8 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 9 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 10 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 11 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 12 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 13 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 14 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 15 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 16 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 17 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 18 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 19 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 20 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 21 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 22 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 23 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 24 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 25 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 26 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 27 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 28 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 29 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 30 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 31 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 32 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 33 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 34 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 35 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 36 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 37 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 38 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 39 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 40 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 41 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 42 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 43 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 44 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 45 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 46 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 47 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 48 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 49 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 50 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 51 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 52 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 53 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 54 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 55 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 56 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 57 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 58 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 59 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 60 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 61 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 62 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 63 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 64 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 65 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 66 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 67 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 68 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 69 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 70 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 71 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 72 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 73 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 74 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 75 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 76 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 77 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 78 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 79 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 80 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 81 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 82 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 83 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 84 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 85 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 86 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 87 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 88 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 89 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 90 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 91 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 92 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 93 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 94 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 95 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 96 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 97 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 98 + ~#x~0.offset, 1);call write~init~int(0, ~#x~0.base, 99 + ~#x~0.offset, 1);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(100);call write~init~int(0, ~#y~0.base, ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 1 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 2 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 3 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 4 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 5 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 6 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 7 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 8 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 9 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 10 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 11 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 12 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 13 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 14 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 15 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 16 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 17 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 18 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 19 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 20 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 21 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 22 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 23 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 24 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 25 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 26 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 27 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 28 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 29 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 30 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 31 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 32 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 33 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 34 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 35 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 36 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 37 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 38 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 39 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 40 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 41 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 42 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 43 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 44 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 45 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 46 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 47 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 48 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 49 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 50 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 51 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 52 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 53 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 54 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 55 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 56 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 57 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 58 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 59 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 60 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 61 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 62 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 63 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 64 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 65 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 66 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 67 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 68 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 69 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 70 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 71 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 72 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 73 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 74 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 75 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 76 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 77 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 78 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 79 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 80 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 81 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 82 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 83 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 84 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 85 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 86 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 87 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 88 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 89 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 90 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 91 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 92 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 93 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 94 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 95 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 96 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 97 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 98 + ~#y~0.offset, 1);call write~init~int(0, ~#y~0.base, 99 + ~#y~0.offset, 1);~i~0 := 0;~j~0 := 0;~k~0 := 0; {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} assume true; {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} {235#true} #47#return; {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} call #t~ret5 := main(); {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} is VALID [2018-11-23 13:04:28,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#(and (= 0 |~#x~0.offset|) (= 0 (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {238#(and (= ~i~0 0) (<= 0 |~#x~0.offset|) (<= |~#x~0.offset| 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))} is VALID [2018-11-23 13:04:28,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {238#(and (= ~i~0 0) (<= 0 |~#x~0.offset|) (<= |~#x~0.offset| 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {262#(= 0 |main_#t~mem1|)} is VALID [2018-11-23 13:04:28,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {262#(= 0 |main_#t~mem1|)} assume !!(0 != #t~mem1);havoc #t~mem1;call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc #t~mem2;#t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {236#false} is VALID [2018-11-23 13:04:28,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {236#false} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {236#false} is VALID [2018-11-23 13:04:28,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {236#false} assume !(0 != #t~mem1);havoc #t~mem1; {236#false} is VALID [2018-11-23 13:04:28,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {236#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {236#false} is VALID [2018-11-23 13:04:28,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {236#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {236#false} is VALID [2018-11-23 13:04:28,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {236#false} assume 0 != #t~mem4;havoc #t~mem4; {236#false} is VALID [2018-11-23 13:04:28,807 INFO L256 TraceCheckUtils]: 13: Hoare triple {236#false} call __VERIFIER_assert(0); {236#false} is VALID [2018-11-23 13:04:28,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {236#false} ~cond := #in~cond; {236#false} is VALID [2018-11-23 13:04:28,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {236#false} assume 0 == ~cond; {236#false} is VALID [2018-11-23 13:04:28,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {236#false} assume !false; {236#false} is VALID [2018-11-23 13:04:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:28,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:28,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-11-23 13:04:28,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 13:04:28,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:28,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:04:28,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:28,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:04:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:04:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:28,912 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-23 13:04:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:29,332 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:29,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 13:04:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:04:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:04:29,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:04:29,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:29,372 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:04:29,373 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:29,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:04:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:29,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:29,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:29,375 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:29,375 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:29,375 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:29,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:29,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:29,376 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:29,376 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:29,376 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:29,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:29,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:29,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:29,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:29,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 13:04:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:29,378 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:29,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:04:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:29,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:29,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:29,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:29,574 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:29,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:29,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:29,575 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~i~0 0) (<= 0 |~#x~0.offset|) (<= |~#x~0.offset| 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0)))) [2018-11-23 13:04:29,575 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:29,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:29,575 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-23 13:04:29,575 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 29) no Hoare annotation was computed. [2018-11-23 13:04:29,575 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 29) no Hoare annotation was computed. [2018-11-23 13:04:29,575 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 14 29) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |~#x~0.base|) (+ |old(~i~0)| |~#x~0.offset|)))) (< 0 |~#x~0.offset|) (not (= 0 |old(~i~0)|)) (< |~#x~0.offset| 0) (and (= ~i~0 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))) [2018-11-23 13:04:29,576 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |~#x~0.base|) (+ |old(~i~0)| |~#x~0.offset|)))) (< 0 |~#x~0.offset|) (not (= 0 |old(~i~0)|)) (< |~#x~0.offset| 0)) [2018-11-23 13:04:29,576 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-23 13:04:29,576 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 24 26) no Hoare annotation was computed. [2018-11-23 13:04:29,576 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 21) no Hoare annotation was computed. [2018-11-23 13:04:29,576 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 21) the Hoare annotation is: (or (not (= 0 (select (select |old(#memory_int)| |~#x~0.base|) (+ |old(~i~0)| |~#x~0.offset|)))) (< 0 |~#x~0.offset|) (not (= 0 |old(~i~0)|)) (< |~#x~0.offset| 0) (and (= ~i~0 0) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ |~#x~0.offset| ~i~0))))) [2018-11-23 13:04:29,576 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 21) no Hoare annotation was computed. [2018-11-23 13:04:29,576 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:04:29,577 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:04:29,577 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:29,577 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:04:29,577 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:04:29,577 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:04:29,579 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:29,580 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:29,580 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:04:29,580 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:29,581 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 13:04:29,581 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-23 13:04:29,581 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:29,581 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:04:29,581 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:29,581 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:29,582 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-23 13:04:29,582 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-23 13:04:29,582 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-23 13:04:29,582 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:29,582 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:29,582 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:04:29,583 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:04:29,583 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:04:29,583 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:29,583 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:04:29,583 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:04:29,583 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-23 13:04:29,584 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-23 13:04:29,584 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:29,584 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:29,584 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:04:29,591 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:29,592 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:29,595 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:29,596 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:29,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:29 BoogieIcfgContainer [2018-11-23 13:04:29,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:29,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:29,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:29,599 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:29,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:25" (3/4) ... [2018-11-23 13:04:29,604 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:29,612 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:29,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:29,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:29,621 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 111 nodes and edges [2018-11-23 13:04:29,621 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2018-11-23 13:04:29,622 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-23 13:04:29,622 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 13:04:29,622 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 13:04:29,622 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:04:29,622 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:04:29,623 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:04:29,650 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == \old(unknown-#memory_int-unknown)[x][\old(i) + x]) || 0 < x) || !(0 == \old(i))) || x < 0) || (i == 0 && 0 == unknown-#memory_int-unknown[x][x + i]) [2018-11-23 13:04:29,671 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/nec40_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:29,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:29,672 INFO L168 Benchmark]: Toolchain (without parser) took 6007.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -508.8 MB). Peak memory consumption was 222.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:29,673 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:29,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:29,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:29,675 INFO L168 Benchmark]: Boogie Preprocessor took 180.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:29,675 INFO L168 Benchmark]: RCFGBuilder took 885.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:29,676 INFO L168 Benchmark]: TraceAbstraction took 4388.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 235.8 MB). Peak memory consumption was 235.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:29,677 INFO L168 Benchmark]: Witness Printer took 71.96 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:04:29,681 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 437.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 180.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4388.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 235.8 MB). Peak memory consumption was 235.8 MB. Max. memory is 7.1 GB. * Witness Printer took 71.96 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2018-11-23 13:04:29,690 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:29,691 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:29,692 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:04:29,692 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(0 == \old(unknown-#memory_int-unknown)[x][\old(i) + x]) || 0 < x) || !(0 == \old(i))) || x < 0) || (i == 0 && 0 == unknown-#memory_int-unknown[x][x + i]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 SDtfs, 10 SDslu, 15 SDs, 0 SdLazy, 8 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 10 NumberOfFragments, 117 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 3197 SizeOfPredicates, 5 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...