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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:57:49,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:57:49,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:57:49,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:57:49,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:57:49,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:57:49,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:57:49,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:57:49,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:57:49,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:57:49,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:57:49,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:57:49,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:57:49,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:57:49,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:57:49,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:57:49,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:57:49,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:57:49,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:57:49,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:57:49,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:57:49,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:57:49,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:57:49,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:57:49,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:57:49,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:57:49,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:57:49,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:57:49,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:57:49,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:57:49,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:57:49,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:57:49,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:57:49,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:57:49,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:57:49,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:57:49,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:57:49,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:57:49,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:57:49,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:57:49,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:57:49,512 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-05 11:57:49,526 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:57:49,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:57:49,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:57:49,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:57:49,528 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:57:49,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:57:49,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:57:49,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:57:49,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:57:49,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:57:49,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:57:49,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:57:49,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:57:49,529 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:57:49,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:57:49,530 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:57:49,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:57:49,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:57:49,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:57:49,531 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:57:49,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:57:49,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:57:49,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:57:49,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:57:49,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:57:49,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:57:49,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:57:49,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:57:49,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:57:49,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:57:49,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:57:49,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:57:49,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:57:49,598 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:57:49,599 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+lhb-reducer.c [2019-09-05 11:57:49,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60837be69/a7c9878737c54341a727c18d86bedb43/FLAG4e7aec433 [2019-09-05 11:57:50,130 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:57:50,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-05 11:57:50,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60837be69/a7c9878737c54341a727c18d86bedb43/FLAG4e7aec433 [2019-09-05 11:57:50,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60837be69/a7c9878737c54341a727c18d86bedb43 [2019-09-05 11:57:50,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:57:50,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:57:50,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:57:50,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:57:50,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:57:50,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145eb45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50, skipping insertion in model container [2019-09-05 11:57:50,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,547 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:57:50,576 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:57:50,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:57:50,752 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:57:50,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:57:50,894 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:57:50,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50 WrapperNode [2019-09-05 11:57:50,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:57:50,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:57:50,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:57:50,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:57:50,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (1/1) ... [2019-09-05 11:57:50,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:57:50,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:57:50,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:57:50,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:57:50,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (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-05 11:57:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:57:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:57:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:57:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:57:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:57:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:57:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:57:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:57:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:57:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:57:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:57:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:57:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:57:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:57:51,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:57:51,383 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 11:57:51,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:57:51 BoogieIcfgContainer [2019-09-05 11:57:51,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:57:51,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:57:51,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:57:51,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:57:51,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:57:50" (1/3) ... [2019-09-05 11:57:51,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc561bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:57:51, skipping insertion in model container [2019-09-05 11:57:51,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:57:50" (2/3) ... [2019-09-05 11:57:51,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc561bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:57:51, skipping insertion in model container [2019-09-05 11:57:51,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:57:51" (3/3) ... [2019-09-05 11:57:51,391 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-05 11:57:51,400 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:57:51,408 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-05 11:57:51,424 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-05 11:57:51,451 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:57:51,451 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:57:51,451 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:57:51,451 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:57:51,452 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:57:51,452 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:57:51,452 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:57:51,452 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:57:51,452 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:57:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-05 11:57:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:57:51,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:51,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:51,474 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-09-05 11:57:51,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:51,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:51,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:51,661 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-05 11:57:51,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:57:51,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:57:51,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:57:51,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:57:51,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:57:51,685 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-09-05 11:57:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:51,757 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-09-05 11:57:51,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:57:51,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-05 11:57:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:51,776 INFO L225 Difference]: With dead ends: 56 [2019-09-05 11:57:51,777 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:57:51,783 INFO L628 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-05 11:57:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:57:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-05 11:57:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:57:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-05 11:57:51,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-09-05 11:57:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:51,839 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-05 11:57:51,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:57:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-05 11:57:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:57:51,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:51,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:51,842 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-09-05 11:57:51,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:51,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:51,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:51,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:51,940 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-05 11:57:51,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:57:51,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:57:51,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:57:51,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:57:51,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:57:51,948 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-09-05 11:57:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:52,005 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-09-05 11:57:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:57:52,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-05 11:57:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:52,008 INFO L225 Difference]: With dead ends: 53 [2019-09-05 11:57:52,010 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 11:57:52,011 INFO L628 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-05 11:57:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 11:57:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-09-05 11:57:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:57:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-05 11:57:52,024 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-09-05 11:57:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:52,024 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-05 11:57:52,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:57:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-05 11:57:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:57:52,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:52,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:52,029 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:52,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-09-05 11:57:52,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:52,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:52,103 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-05 11:57:52,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:57:52,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:57:52,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:57:52,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:57:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:57:52,105 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-09-05 11:57:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:52,158 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-09-05 11:57:52,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:57:52,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 11:57:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:52,160 INFO L225 Difference]: With dead ends: 62 [2019-09-05 11:57:52,160 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:57:52,161 INFO L628 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-05 11:57:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:57:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-09-05 11:57:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:57:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-05 11:57:52,168 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-09-05 11:57:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:52,168 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-05 11:57:52,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:57:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-05 11:57:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:57:52,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:52,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:52,170 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-09-05 11:57:52,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:52,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:52,226 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-05 11:57:52,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:57:52,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:57:52,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:57:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:57:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:57:52,228 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-09-05 11:57:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:52,259 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-09-05 11:57:52,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:57:52,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-05 11:57:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:52,261 INFO L225 Difference]: With dead ends: 56 [2019-09-05 11:57:52,261 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:57:52,262 INFO L628 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-05 11:57:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:57:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-05 11:57:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:57:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-05 11:57:52,267 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-09-05 11:57:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:52,267 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-05 11:57:52,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:57:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-05 11:57:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:57:52,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:52,268 INFO L399 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-05 11:57:52,268 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-09-05 11:57:52,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:52,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:52,736 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2019-09-05 11:57:53,033 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 40 [2019-09-05 11:57:53,110 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-05 11:57:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:57:53,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-05 11:57:53,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:57:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:57:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:57:53,112 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-09-05 11:57:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:53,417 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-05 11:57:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:57:53,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-05 11:57:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:53,420 INFO L225 Difference]: With dead ends: 47 [2019-09-05 11:57:53,420 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:57:53,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:57:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:57:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 11:57:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:57:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-05 11:57:53,430 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-09-05 11:57:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:53,434 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-05 11:57:53,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:57:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-05 11:57:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:57:53,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:53,435 INFO L399 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-05 11:57:53,435 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-09-05 11:57:53,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:53,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:53,516 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-05 11:57:53,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:57:53,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:57:53,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:57:53,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:57:53,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:57:53,518 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-09-05 11:57:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:53,589 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-05 11:57:53,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:57:53,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-05 11:57:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:53,591 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:57:53,591 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:57:53,591 INFO L628 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-05 11:57:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:57:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-09-05 11:57:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:57:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-05 11:57:53,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-09-05 11:57:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:53,601 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-05 11:57:53,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:57:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-05 11:57:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:57:53,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:53,602 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:53,602 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-09-05 11:57:53,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:53,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:53,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:55,867 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-05 11:57:55,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:57:55,868 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 [2019-09-05 11:57:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:57:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:55,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:57:55,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:57:58,133 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-05 11:57:58,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:57:58,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-09-05 11:57:58,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:57:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:57:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2019-09-05 11:57:58,150 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2019-09-05 11:58:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:05,443 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-05 11:58:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:05,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-09-05 11:58:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:05,445 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:58:05,445 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:58:05,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2019-09-05 11:58:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:58:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-05 11:58:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:58:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-05 11:58:05,459 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2019-09-05 11:58:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:05,460 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-05 11:58:05,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:58:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-05 11:58:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:58:05,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:05,462 INFO L399 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, 1] [2019-09-05 11:58:05,463 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1779426667, now seen corresponding path program 1 times [2019-09-05 11:58:05,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:05,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:05,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:05,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:05,682 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-05 11:58:05,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:58:05,683 INFO L223 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:58:05,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:05,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:58:05,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:58:06,092 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-05 11:58:06,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:58:06,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2019-09-05 11:58:06,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:58:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:58:06,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:58:06,097 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2019-09-05 11:58:26,049 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-09-05 11:58:28,130 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 .cse0) 1) (+ .cse1 c_main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ .cse1 c_main_~main__index2~0 (* (- 4294967296) .cse0) 4294867296) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 1) c_main_~main__index1~0) c_main_~main__index2~0 1) 4294967296)) (* 4294967296 (div (+ c_main_~main__index1~0 (- 2)) 4294967296)) 99998)))) is different from false [2019-09-05 11:58:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:32,690 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-05 11:58:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:58:32,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-09-05 11:58:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:32,853 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:58:32,853 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:58:32,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=60, Invalid=95, Unknown=5, NotChecked=22, Total=182 [2019-09-05 11:58:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:58:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:58:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:58:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:58:32,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-09-05 11:58:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:32,855 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:58:32,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:58:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:58:32,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:58:32,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:58:46,889 WARN L188 SmtUtils]: Spent 13.95 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-05 11:58:46,991 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-09-05 11:58:47,083 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,084 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:58:47,084 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,084 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,084 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:58:47,084 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:58:47,084 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,084 INFO L446 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-09-05 11:58:47,085 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-09-05 11:58:47,085 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2019-09-05 11:58:47,085 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-09-05 11:58:47,085 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-09-05 11:58:47,085 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-09-05 11:58:47,085 INFO L439 ceAbstractionStarter]: At program point L114(lines 93 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 .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)) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 1) main_~main__index1~0) (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1) 4294967296)) 99998))) (and (<= main_~main__index2~0 (+ .cse8 99999)) .cse0 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse8 1) .cse9))))) [2019-09-05 11:58:47,086 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-09-05 11:58:47,086 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-09-05 11:58:47,086 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-09-05 11:58:47,086 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-09-05 11:58:47,086 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-09-05 11:58:47,086 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) 4294867296) 4294967296)) 1) main_~main__index1~0))) [2019-09-05 11:58:47,087 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-09-05 11:58:47,087 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-09-05 11:58:47,087 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-05 11:58:47,087 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-05 11:58:47,087 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-09-05 11:58:47,087 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-09-05 11:58:47,087 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-09-05 11:58:47,087 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-09-05 11:58:47,087 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-05 11:58:47,088 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-05 11:58:47,088 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2019-09-05 11:58:47,088 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-09-05 11:58:47,088 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-09-05 11:58:47,088 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2019-09-05 11:58:47,088 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-09-05 11:58:47,088 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-09-05 11:58:47,088 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-09-05 11:58:47,088 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-09-05 11:58:47,089 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-09-05 11:58:47,089 INFO L439 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 1) main_~main__index1~0) (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1) 4294967296)) 99998))) [2019-09-05 11:58:47,089 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-05 11:58:47,089 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-09-05 11:58:47,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,106 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,106 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:58:47 BoogieIcfgContainer [2019-09-05 11:58:47,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:58:47,119 INFO L168 Benchmark]: Toolchain (without parser) took 56586.40 ms. Allocated memory was 132.6 MB in the beginning and 261.1 MB in the end (delta: 128.5 MB). Free memory was 87.1 MB in the beginning and 135.9 MB in the end (delta: -48.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,119 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 11:58:47,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.68 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.1 MB in the beginning and 174.3 MB in the end (delta: -87.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,121 INFO L168 Benchmark]: Boogie Preprocessor took 52.42 ms. Allocated memory is still 199.2 MB. Free memory was 174.3 MB in the beginning and 172.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,122 INFO L168 Benchmark]: RCFGBuilder took 435.88 ms. Allocated memory is still 199.2 MB. Free memory was 172.5 MB in the beginning and 153.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,123 INFO L168 Benchmark]: TraceAbstraction took 55731.63 ms. Allocated memory was 199.2 MB in the beginning and 261.1 MB in the end (delta: 61.9 MB). Free memory was 153.0 MB in the beginning and 135.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,127 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.21 ms. Allocated memory is still 132.6 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 362.68 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.1 MB in the beginning and 174.3 MB in the end (delta: -87.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.42 ms. Allocated memory is still 199.2 MB. Free memory was 174.3 MB in the beginning and 172.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 435.88 ms. Allocated memory is still 199.2 MB. Free memory was 172.5 MB in the beginning and 153.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55731.63 ms. Allocated memory was 199.2 MB in the beginning and 261.1 MB in the end (delta: 61.9 MB). Free memory was 153.0 MB in the beginning and 135.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 79.0 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 * 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: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && main__index2 <= 4294967296 * ((-1 * main__index1 + 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) / 4294967296) + 99998 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2019-09-05 11:58:47,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,141 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,141 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:47,143 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)) && main__index2 <= 4294967296 * ((-1 * main__index1 + 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) / 4294967296) + 99998) || (((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) + 4294867296) / 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: 92]: 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, 42 locations, 4 error locations. SAFE Result, 55.6s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 34.7s AutomataDifference, 0.0s DeadEndRemovalTime, 14.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 204 SDslu, 307 SDs, 0 SdLazy, 187 SolverSat, 22 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 48 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 394 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1251 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 409 FormulaSimplificationTreeSizeReductionInter, 14.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 46098 SizeOfPredicates, 4 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10/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...