java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:11:50,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:11:50,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:11:50,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:11:50,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:11:50,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:11:50,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:11:50,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:11:50,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:11:50,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:11:50,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:11:50,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:11:50,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:11:50,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:11:50,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:11:50,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:11:50,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:11:50,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:11:50,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:11:50,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:11:50,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:11:50,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:11:50,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:11:50,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:11:50,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:11:50,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:11:50,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:11:50,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:11:50,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:11:50,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:11:50,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:11:50,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:11:50,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:11:50,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:11:50,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:11:50,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:11:50,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:11:50,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:11:50,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:11:50,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:11:50,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:11:50,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:11:50,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:11:50,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:11:50,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:11:50,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:11:50,711 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:11:50,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:11:50,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:11:50,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:11:50,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:11:50,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:11:50,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:11:50,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:11:50,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:11:50,714 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:11:50,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:11:50,714 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:11:50,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:11:50,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:11:50,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:11:50,715 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:11:50,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:11:50,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:11:50,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:11:50,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:11:50,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:11:50,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:11:50,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:11:50,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:11:50,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:11:50,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:11:50,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:11:50,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:11:50,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:11:50,779 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:11:50,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-16 16:11:50,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae2e5942/e885079fd37b4d7096181f27196bd7f3/FLAG4d20b5b3a [2019-09-16 16:11:51,324 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:11:51,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-16 16:11:51,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae2e5942/e885079fd37b4d7096181f27196bd7f3/FLAG4d20b5b3a [2019-09-16 16:11:51,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae2e5942/e885079fd37b4d7096181f27196bd7f3 [2019-09-16 16:11:51,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:11:51,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:11:51,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:11:51,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:11:51,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:11:51,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:11:51" (1/1) ... [2019-09-16 16:11:51,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d428e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:51, skipping insertion in model container [2019-09-16 16:11:51,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:11:51" (1/1) ... [2019-09-16 16:11:51,762 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:11:51,793 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:11:52,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:11:52,015 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:11:52,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:11:52,152 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:11:52,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52 WrapperNode [2019-09-16 16:11:52,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:11:52,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:11:52,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:11:52,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:11:52,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (1/1) ... [2019-09-16 16:11:52,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (1/1) ... [2019-09-16 16:11:52,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (1/1) ... [2019-09-16 16:11:52,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (1/1) ... [2019-09-16 16:11:52,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (1/1) ... [2019-09-16 16:11:52,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (1/1) ... [2019-09-16 16:11:52,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (1/1) ... [2019-09-16 16:11:52,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:11:52,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:11:52,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:11:52,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:11:52,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (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 [2019-09-16 16:11:52,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:11:52,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:11:52,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:11:52,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:11:52,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 16:11:52,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 16:11:52,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-16 16:11:52,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:11:52,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 16:11:52,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:11:52,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:11:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:11:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:11:52,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:11:52,621 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:11:52,621 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 16:11:52,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:11:52 BoogieIcfgContainer [2019-09-16 16:11:52,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:11:52,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:11:52,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:11:52,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:11:52,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:11:51" (1/3) ... [2019-09-16 16:11:52,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430acc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:11:52, skipping insertion in model container [2019-09-16 16:11:52,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:11:52" (2/3) ... [2019-09-16 16:11:52,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430acc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:11:52, skipping insertion in model container [2019-09-16 16:11:52,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:11:52" (3/3) ... [2019-09-16 16:11:52,630 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-16 16:11:52,638 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:11:52,646 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-16 16:11:52,663 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-16 16:11:52,690 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:11:52,691 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:11:52,691 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:11:52,691 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:11:52,691 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:11:52,691 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:11:52,691 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:11:52,692 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:11:52,692 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:11:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-09-16 16:11:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-16 16:11:52,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:52,712 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:52,714 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-09-16 16:11:52,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:52,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:52,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:52,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:52,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:52,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:52,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:11:52,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:11:52,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:11:52,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:11:52,937 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-09-16 16:11:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:52,987 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-09-16 16:11:52,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:11:52,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-16 16:11:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:53,000 INFO L225 Difference]: With dead ends: 51 [2019-09-16 16:11:53,000 INFO L226 Difference]: Without dead ends: 33 [2019-09-16 16:11:53,004 INFO L636 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 [2019-09-16 16:11:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-16 16:11:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-09-16 16:11:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-16 16:11:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-16 16:11:53,042 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-09-16 16:11:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:53,043 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-16 16:11:53,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:11:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-16 16:11:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 16:11:53,044 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:53,044 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:53,045 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-09-16 16:11:53,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:53,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:53,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:53,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:53,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:53,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:11:53,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:11:53,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:11:53,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:11:53,122 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-09-16 16:11:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:53,175 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-16 16:11:53,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:11:53,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-16 16:11:53,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:53,178 INFO L225 Difference]: With dead ends: 51 [2019-09-16 16:11:53,178 INFO L226 Difference]: Without dead ends: 49 [2019-09-16 16:11:53,179 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:11:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-16 16:11:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-09-16 16:11:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-16 16:11:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-09-16 16:11:53,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-09-16 16:11:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:53,194 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-09-16 16:11:53,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:11:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-09-16 16:11:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 16:11:53,195 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:53,195 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:53,196 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-09-16 16:11:53,196 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:53,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:11:53,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:11:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:11:53,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:11:53,257 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-09-16 16:11:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:53,301 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-09-16 16:11:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:11:53,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-16 16:11:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:53,303 INFO L225 Difference]: With dead ends: 60 [2019-09-16 16:11:53,303 INFO L226 Difference]: Without dead ends: 40 [2019-09-16 16:11:53,304 INFO L636 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 [2019-09-16 16:11:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-16 16:11:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-16 16:11:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-16 16:11:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-16 16:11:53,310 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-09-16 16:11:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:53,311 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-16 16:11:53,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:11:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-16 16:11:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:11:53,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:53,312 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:53,313 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-09-16 16:11:53,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:53,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:53,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:53,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:11:53,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:11:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:11:53,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:11:53,373 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-09-16 16:11:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:53,426 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-09-16 16:11:53,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:11:53,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-16 16:11:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:53,428 INFO L225 Difference]: With dead ends: 54 [2019-09-16 16:11:53,428 INFO L226 Difference]: Without dead ends: 34 [2019-09-16 16:11:53,429 INFO L636 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 [2019-09-16 16:11:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-16 16:11:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-16 16:11:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-16 16:11:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-16 16:11:53,437 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-09-16 16:11:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:53,437 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-16 16:11:53,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:11:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-16 16:11:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:11:53,440 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:53,440 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:53,440 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:53,441 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-09-16 16:11:53,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:54,512 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 89 [2019-09-16 16:11:54,899 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 73 [2019-09-16 16:11:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:54,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:54,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 16:11:54,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:11:54,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:11:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:11:54,924 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-09-16 16:11:55,185 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-09-16 16:11:55,335 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2019-09-16 16:11:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:55,375 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-16 16:11:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:11:55,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-16 16:11:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:55,376 INFO L225 Difference]: With dead ends: 44 [2019-09-16 16:11:55,376 INFO L226 Difference]: Without dead ends: 29 [2019-09-16 16:11:55,377 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:11:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-16 16:11:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-16 16:11:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-16 16:11:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-16 16:11:55,383 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-09-16 16:11:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:55,384 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-16 16:11:55,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:11:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-16 16:11:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 16:11:55,385 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:55,386 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:55,386 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-09-16 16:11:55,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:55,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:55,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:11:55,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:11:55,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:11:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:11:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:11:55,452 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-09-16 16:11:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:11:55,532 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-16 16:11:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:11:55,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-16 16:11:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:11:55,535 INFO L225 Difference]: With dead ends: 42 [2019-09-16 16:11:55,535 INFO L226 Difference]: Without dead ends: 40 [2019-09-16 16:11:55,537 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:11:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-16 16:11:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-09-16 16:11:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-16 16:11:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-16 16:11:55,548 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-09-16 16:11:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:11:55,550 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-16 16:11:55,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:11:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-16 16:11:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:11:55,552 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:11:55,552 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:11:55,552 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:11:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:11:55,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-09-16 16:11:55,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:11:55,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:11:55,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:11:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:11:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:11:55,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:11:55,951 INFO L224 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) [2019-09-16 16:11:55,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:11:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:11:56,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-16 16:11:56,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:11:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:11:56,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:11:56,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-09-16 16:11:56,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:11:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:11:56,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:11:56,216 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-09-16 16:12:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:00,899 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-16 16:12:00,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:12:00,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-16 16:12:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:00,901 INFO L225 Difference]: With dead ends: 44 [2019-09-16 16:12:00,901 INFO L226 Difference]: Without dead ends: 36 [2019-09-16 16:12:00,901 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:12:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-16 16:12:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-09-16 16:12:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-16 16:12:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-16 16:12:00,906 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 22 [2019-09-16 16:12:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:00,907 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-16 16:12:00,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:12:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-16 16:12:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:12:00,908 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:12:00,908 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:12:00,908 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:12:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:12:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1426055415, now seen corresponding path program 1 times [2019-09-16 16:12:00,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:12:00,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:12:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:00,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:12:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:12:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:02,146 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-09-16 16:12:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:02,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:12:02,277 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:12:02,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:12:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:12:02,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-16 16:12:02,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:12:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:12:07,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:12:07,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 11 [2019-09-16 16:12:07,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:12:07,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:12:07,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=81, Unknown=2, NotChecked=0, Total=110 [2019-09-16 16:12:07,354 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2019-09-16 16:12:14,539 WARN L191 SmtUtils]: Spent 6.71 s on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-09-16 16:12:18,735 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4294967296 (div c_main_~main__index1~0 4294967296))) (.cse0 (div c_main_~main__index2~0 4294967296))) (and (<= (+ c_main_~main__index1~0 (* 4294967296 (div (+ c_main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ c_main_~main__index1~0 (- 1)) 4294967296)) c_main_~main__index2~0 1)) (<= (+ c_main_~main__index1~0 (* 4294967296 .cse0) 1) (+ .cse1 c_main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ .cse1 c_main_~main__index2~0 (* (- 4294967296) .cse0) 4294867297) 4294967296)) 1) c_main_~main__index1~0))) is different from false [2019-09-16 16:12:40,923 WARN L191 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 61 DAG size of output: 16 [2019-09-16 16:12:49,652 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-09-16 16:12:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:12:49,654 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-09-16 16:12:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:12:49,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-09-16 16:12:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:12:49,655 INFO L225 Difference]: With dead ends: 32 [2019-09-16 16:12:49,655 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:12:49,656 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=4, NotChecked=26, Total=240 [2019-09-16 16:12:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:12:49,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:12:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:12:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:12:49,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-16 16:12:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:12:49,657 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:12:49,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:12:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:12:49,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:12:49,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:13:30,318 WARN L191 SmtUtils]: Spent 40.61 s on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-16 16:13:35,215 WARN L191 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-16 16:13:35,459 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2019-09-16 16:13:35,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:13:35,547 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:13:35,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:13:35,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:13:35,547 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:13:35,547 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:13:35,547 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:13:35,548 INFO L446 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-09-16 16:13:35,548 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2019-09-16 16:13:35,548 INFO L439 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse1 (let ((.cse7 (div main_~main__index2~0 4294967296)) (.cse8 (div main_~main__index1~0 4294967296))) (or (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* (- 17179869184) .cse8) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse3 (select .cse6 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse7))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))) (<= (+ main_~main__index1~0 (* 4294967296 .cse7)) (+ (* 4294967296 .cse8) main_~main__index2~0)))))) (or (and .cse0 .cse1 (<= (+ (* 4294967296 (div (+ main_~main__index2~0 (* (- 4294967296) (div (+ main_~main__index1~0 (- 2)) 4294967296)) 4294867298) 4294967296)) main_~main__index1~0) (+ main_~main__index2~0 1))) (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (* (- 1) main_~main__index2~0) 4294967294) 4294967296)) main_~main__index1~0 (- 1)) 4294967296)) 99998)) .cse0 .cse1) (= main_~main__loop_entered~0 0))) [2019-09-16 16:13:35,548 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-09-16 16:13:35,548 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-09-16 16:13:35,549 INFO L439 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse7 (div main_~main__index1~0 4294967296)) (.cse6 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (* 4294967296 .cse6)) (.cse9 (+ (* 4294967296 .cse7) main_~main__index2~0))) (or (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (* (- 1) main_~main__index2~0) 4294967294) 4294967296)) main_~main__index1~0 (- 1)) 4294967296)) 99998)) .cse0 (or (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ (* (- 17179869184) .cse7) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse2 (select .cse5 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse6))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse2 4294967296)))) (.cse1 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ main_~main__index1~0 .cse8) .cse9))) (and (<= main_~main__index2~0 (+ .cse8 99999)) .cse0 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse8 1) .cse9))))) [2019-09-16 16:13:35,549 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-09-16 16:13:35,549 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-09-16 16:13:35,550 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-09-16 16:13:35,550 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~main__index1~0 4294967296))) (.cse0 (div main_~main__index2~0 4294967296))) (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 .cse0) 1) (+ .cse1 main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ .cse1 main_~main__index2~0 (* (- 4294967296) .cse0) 4294867297) 4294967296)) 1) main_~main__index1~0))) [2019-09-16 16:13:35,550 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-09-16 16:13:35,550 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-09-16 16:13:35,550 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse0 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2)))) [2019-09-16 16:13:35,551 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-09-16 16:13:35,551 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-09-16 16:13:35,551 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-16 16:13:35,551 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-09-16 16:13:35,551 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-09-16 16:13:35,551 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-09-16 16:13:35,551 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2019-09-16 16:13:35,552 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2019-09-16 16:13:35,552 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2019-09-16 16:13:35,552 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-09-16 16:13:35,552 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-16 16:13:35,552 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-09-16 16:13:35,552 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-09-16 16:13:35,553 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-16 16:13:35,553 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-16 16:13:35,553 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-09-16 16:13:35,563 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,564 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,567 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,580 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,584 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,585 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,588 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,589 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:13:35 BoogieIcfgContainer [2019-09-16 16:13:35,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:13:35,597 INFO L168 Benchmark]: Toolchain (without parser) took 103850.27 ms. Allocated memory was 131.1 MB in the beginning and 270.0 MB in the end (delta: 138.9 MB). Free memory was 86.7 MB in the beginning and 203.0 MB in the end (delta: -116.3 MB). Peak memory consumption was 148.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:13:35,598 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-16 16:13:35,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.24 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 86.5 MB in the beginning and 173.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:13:35,599 INFO L168 Benchmark]: Boogie Preprocessor took 37.03 ms. Allocated memory is still 198.2 MB. Free memory was 173.5 MB in the beginning and 171.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:13:35,600 INFO L168 Benchmark]: RCFGBuilder took 432.36 ms. Allocated memory is still 198.2 MB. Free memory was 171.5 MB in the beginning and 153.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:13:35,601 INFO L168 Benchmark]: TraceAbstraction took 102971.28 ms. Allocated memory was 198.2 MB in the beginning and 270.0 MB in the end (delta: 71.8 MB). Free memory was 153.0 MB in the beginning and 203.0 MB in the end (delta: -49.9 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:13:35,605 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 405.24 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 86.5 MB in the beginning and 173.5 MB in the end (delta: -87.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.03 ms. Allocated memory is still 198.2 MB. Free memory was 173.5 MB in the beginning and 171.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 432.36 ms. Allocated memory is still 198.2 MB. Free memory was 171.5 MB in the beginning and 153.7 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102971.28 ms. Allocated memory was 198.2 MB in the beginning and 270.0 MB in the end (delta: 71.8 MB). Free memory was 153.0 MB in the beginning and 203.0 MB in the end (delta: -49.9 MB). Peak memory consumption was 147.9 MB. 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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 - 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: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2019-09-16 16:13:35,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,619 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,621 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,625 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((__VERIFIER_assert__cond == 1 && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) && 4294967296 * ((main__index2 + -4294967296 * ((main__index1 + -2) / 4294967296) + 4294867298) / 4294967296) + main__index1 <= main__index2 + 1) || ((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + -1 * main__index2 + 4294967294) / 4294967296) + main__index1 + -1) / 4294967296) + 99998 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2))) || main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2019-09-16 16:13:35,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,631 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-16 16:13:35,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + -1 * main__index2 + 4294967294) / 4294967296) + main__index1 + -1) / 4294967296) + 99998 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && 4294967296 * ((4294967296 * (main__index1 / 4294967296) + main__index2 + -4294967296 * (main__index2 / 4294967296) + 4294867297) / 4294967296) + 1 <= main__index1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 102.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 47.7s AutomataDifference, 0.0s DeadEndRemovalTime, 45.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 217 SDtfs, 210 SDslu, 337 SDs, 0 SdLazy, 230 SolverSat, 22 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 28.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 8 MinimizatonAttempts, 50 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 25 NumberOfFragments, 723 HoareAnnotationTreeSize, 12 FomulaSimplifications, 990 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 489 FormulaSimplificationTreeSizeReductionInter, 45.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 72888 SizeOfPredicates, 4 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 9/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...