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-112bae1 [2019-09-08 02:52:57,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:52:57,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:52:57,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:52:57,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:52:57,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:52:57,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:52:57,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:52:57,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:52:57,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:52:57,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:52:57,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:52:57,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:52:57,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:52:57,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:52:57,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:52:57,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:52:57,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:52:57,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:52:57,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:52:57,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:52:57,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:52:57,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:52:57,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:52:57,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:52:57,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:52:57,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:52:57,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:52:57,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:52:57,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:52:57,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:52:57,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:52:57,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:52:57,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:52:57,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:52:57,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:52:57,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:52:57,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:52:57,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:52:57,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:52:57,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:52:57,591 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-08 02:52:57,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:52:57,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:52:57,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:52:57,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:52:57,606 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:52:57,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:52:57,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:52:57,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:52:57,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:52:57,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:52:57,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:52:57,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:52:57,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:52:57,607 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:52:57,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:52:57,608 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:52:57,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:52:57,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:52:57,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:52:57,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:52:57,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:52:57,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:52:57,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:52:57,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:52:57,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:52:57,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:52:57,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:52:57,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:52:57,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:52:57,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:52:57,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:52:57,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:52:57,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:52:57,670 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:52:57,671 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-08 02:52:57,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387a65cb4/3c36f46b6dcf4c2fb0b2efd2b9f86889/FLAG75e103f99 [2019-09-08 02:52:58,200 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:52:58,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-08 02:52:58,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387a65cb4/3c36f46b6dcf4c2fb0b2efd2b9f86889/FLAG75e103f99 [2019-09-08 02:52:58,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387a65cb4/3c36f46b6dcf4c2fb0b2efd2b9f86889 [2019-09-08 02:52:58,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:52:58,626 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:52:58,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:52:58,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:52:58,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:52:58,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:52:58" (1/1) ... [2019-09-08 02:52:58,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:58, skipping insertion in model container [2019-09-08 02:52:58,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:52:58" (1/1) ... [2019-09-08 02:52:58,641 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:52:58,661 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:52:58,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:52:58,858 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:52:58,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:52:58,999 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:52:59,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59 WrapperNode [2019-09-08 02:52:59,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:52:59,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:52:59,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:52:59,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:52:59,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (1/1) ... [2019-09-08 02:52:59,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (1/1) ... [2019-09-08 02:52:59,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (1/1) ... [2019-09-08 02:52:59,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (1/1) ... [2019-09-08 02:52:59,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (1/1) ... [2019-09-08 02:52:59,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (1/1) ... [2019-09-08 02:52:59,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (1/1) ... [2019-09-08 02:52:59,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:52:59,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:52:59,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:52:59,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:52:59,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (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-08 02:52:59,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:52:59,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:52:59,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:52:59,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:52:59,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 02:52:59,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:52:59,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 02:52:59,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:52:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:52:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:52:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:52:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:52:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:52:59,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:52:59,390 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:52:59,391 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 02:52:59,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:52:59 BoogieIcfgContainer [2019-09-08 02:52:59,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:52:59,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:52:59,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:52:59,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:52:59,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:52:58" (1/3) ... [2019-09-08 02:52:59,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7b15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:52:59, skipping insertion in model container [2019-09-08 02:52:59,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:59" (2/3) ... [2019-09-08 02:52:59,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d7b15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:52:59, skipping insertion in model container [2019-09-08 02:52:59,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:52:59" (3/3) ... [2019-09-08 02:52:59,400 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-08 02:52:59,417 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:52:59,425 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-08 02:52:59,456 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-08 02:52:59,485 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:52:59,486 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:52:59,486 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:52:59,486 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:52:59,486 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:52:59,486 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:52:59,486 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:52:59,486 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:52:59,486 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:52:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-09-08 02:52:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:52:59,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:59,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:59,509 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-09-08 02:52:59,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:59,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:59,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:59,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:59,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:59,702 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-08 02:52:59,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:59,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:52:59,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:52:59,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:52:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:52:59,720 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-09-08 02:52:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:59,767 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-09-08 02:52:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:52:59,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-08 02:52:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:59,779 INFO L225 Difference]: With dead ends: 51 [2019-09-08 02:52:59,779 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:52:59,782 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-08 02:52:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:52:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-09-08 02:52:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 02:52:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-08 02:52:59,820 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-09-08 02:52:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:59,821 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-08 02:52:59,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:52:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-08 02:52:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:52:59,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:59,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:59,823 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-09-08 02:52:59,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:59,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:59,900 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-08 02:52:59,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:59,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:52:59,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:52:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:52:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:52:59,903 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-09-08 02:52:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:59,957 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-08 02:52:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:52:59,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-08 02:52:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:59,959 INFO L225 Difference]: With dead ends: 51 [2019-09-08 02:52:59,962 INFO L226 Difference]: Without dead ends: 49 [2019-09-08 02:52:59,963 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-08 02:52:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-08 02:52:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-09-08 02:52:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:52:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-09-08 02:52:59,973 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-09-08 02:52:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:59,974 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-09-08 02:52:59,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:52:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-09-08 02:52:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:52:59,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:59,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:59,977 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:59,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-09-08 02:52:59,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:59,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:59,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:59,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:59,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:00,019 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-08 02:53:00,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:53:00,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:53:00,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:53:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:53:00,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:53:00,021 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-09-08 02:53:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:53:00,082 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-09-08 02:53:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:53:00,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-08 02:53:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:53:00,084 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:53:00,084 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:53:00,085 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-08 02:53:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:53:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-08 02:53:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:53:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-08 02:53:00,099 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-09-08 02:53:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:53:00,099 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-08 02:53:00,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:53:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-08 02:53:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:53:00,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:53:00,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:53:00,105 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:53:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:53:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-09-08 02:53:00,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:53:00,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:53:00,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:00,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:53:00,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:00,158 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-08 02:53:00,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:53:00,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:53:00,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:53:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:53:00,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:53:00,160 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-09-08 02:53:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:53:00,191 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-09-08 02:53:00,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:53:00,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-08 02:53:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:53:00,193 INFO L225 Difference]: With dead ends: 54 [2019-09-08 02:53:00,193 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:53:00,193 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-08 02:53:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:53:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-08 02:53:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 02:53:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-08 02:53:00,199 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-09-08 02:53:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:53:00,199 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-08 02:53:00,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:53:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-08 02:53:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:53:00,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:53:00,200 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-08 02:53:00,200 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:53:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:53:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-09-08 02:53:00,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:53:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:53:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:53:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:00,726 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-09-08 02:53:01,414 WARN L188 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 92 [2019-09-08 02:53:01,739 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 73 [2019-09-08 02:53:01,759 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-08 02:53:01,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:53:01,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 02:53:01,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:53:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:53:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:53:01,761 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-09-08 02:53:03,975 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 42 [2019-09-08 02:53:04,146 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2019-09-08 02:53:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:53:04,179 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-08 02:53:04,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:53:04,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-08 02:53:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:53:04,182 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:53:04,182 INFO L226 Difference]: Without dead ends: 29 [2019-09-08 02:53:04,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:53:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-08 02:53:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-08 02:53:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:53:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-08 02:53:04,188 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-09-08 02:53:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:53:04,189 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-08 02:53:04,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:53:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-08 02:53:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:53:04,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:53:04,190 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-08 02:53:04,190 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:53:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:53:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-09-08 02:53:04,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:53:04,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:53:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:04,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:53:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:04,237 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-08 02:53:04,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:53:04,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:53:04,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:53:04,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:53:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:53:04,239 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-09-08 02:53:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:53:04,300 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-08 02:53:04,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:53:04,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-08 02:53:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:53:04,301 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:53:04,301 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 02:53:04,302 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-08 02:53:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 02:53:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-09-08 02:53:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 02:53:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-08 02:53:04,307 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-09-08 02:53:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:53:04,308 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-08 02:53:04,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:53:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-08 02:53:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:53:04,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:53:04,309 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] [2019-09-08 02:53:04,309 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:53:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:53:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-09-08 02:53:04,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:53:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:53:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:04,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:53:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:06,503 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-08 02:53:06,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:53:06,503 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-08 02:53:06,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:53:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:06,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:53:06,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:53:08,858 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-08 02:53:08,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:53:08,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-09-08 02:53:08,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:53:08,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:53:08,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=26, Unknown=2, NotChecked=0, Total=42 [2019-09-08 02:53:08,871 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-09-08 02:53:12,413 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-09-08 02:53:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:53:16,915 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-08 02:53:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:53:16,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-08 02:53:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:53:16,917 INFO L225 Difference]: With dead ends: 38 [2019-09-08 02:53:16,917 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 02:53:16,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=19, Invalid=35, Unknown=2, NotChecked=0, Total=56 [2019-09-08 02:53:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 02:53:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 02:53:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:53:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-08 02:53:16,923 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 22 [2019-09-08 02:53:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:53:16,923 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-08 02:53:16,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:53:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-08 02:53:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 02:53:16,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:53:16,924 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] [2019-09-08 02:53:16,925 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:53:16,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:53:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1426055415, now seen corresponding path program 1 times [2019-09-08 02:53:16,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:53:16,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:53:16,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:16,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:53:16,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:53:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:33,478 WARN L188 SmtUtils]: Spent 13.83 s on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-09-08 02:53:35,511 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse4 (* 4294967296 (div c_main_~main__index2~0 4294967296))) (.cse6 (div c_main_~main__index1~0 4294967296))) (let ((.cse1 (* (- 4294967296) .cse6)) (.cse2 (* (- 1) c_main_~main__index2~0)) (.cse0 (* 4294967296 .cse6)) (.cse5 (+ c_main_~main__index1~0 .cse4))) (or (let ((.cse3 (* 4294967296 (div (+ c_main_~main__index2~0 4294767298) 4294967296)))) (and (<= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~main__index1~0 .cse2 .cse3 .cse4 4294967296) 4294967296))) .cse5) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 .cse2 .cse3 99997) 4294967296)) 100000)))) (<= (+ (* 4294967296 (div (+ .cse1 c_main_~main__index1~0 .cse2 (* 4294967296 (div (+ c_main_~main__index2~0 8589734594) 4294967296)) .cse4 4294967296) 4294967296)) .cse0) .cse5)))) (<= (* 4294967296 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) c_main_~main__index2~0) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)) 1) c_main_~main__index1~0)) is different from false [2019-09-08 02:53:41,828 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-09-08 02:53:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-08 02:53:42,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:53:42,077 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-08 02:53:42,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:53:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:53:42,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:53:42,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:53:44,879 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-08 02:53:44,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:53:44,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 12 [2019-09-08 02:53:44,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 02:53:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 02:53:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=76, Unknown=5, NotChecked=18, Total=132 [2019-09-08 02:53:44,884 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 12 states. [2019-09-08 02:53:54,615 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_main_~main__index1~0 4294967296))) (let ((.cse2 (* 4294967296 (div c_main_~main__index2~0 4294967296))) (.cse0 (* 4294967296 .cse1))) (and (<= (+ .cse0 (* 4294967296 (div (+ (* (- 4294967296) .cse1) c_main_~main__index1~0 (* (- 1) c_main_~main__index2~0) (* 4294967296 (div (+ c_main_~main__index2~0 4294767298) 4294967296)) .cse2 4294967296) 4294967296))) (+ c_main_~main__index1~0 .cse2)) (<= (+ .cse2 1) c_main_~main__index2~0) (<= c_main_~main__index2~0 (+ .cse2 99999)) (<= (+ 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)) (<= (* 4294967296 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) c_main_~main__index2~0) (<= c_main_~main__index1~0 (+ .cse0 99999)) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)) 1) c_main_~main__index1~0)))) is different from false [2019-09-08 02:53:59,215 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4294967296 (div c_main_~main__index2~0 4294967296))) (.cse7 (div c_main_~main__index1~0 4294967296))) (let ((.cse5 (* 4294967296 .cse7)) (.cse4 (* (- 4294967296) .cse7)) (.cse2 (* (- 1) c_main_~main__index2~0)) (.cse3 (* 4294967296 (div (+ c_main_~main__index2~0 4294767298) 4294967296))) (.cse6 (+ c_main_~main__index1~0 .cse1))) (let ((.cse0 (<= (+ .cse5 (* 4294967296 (div (+ .cse4 c_main_~main__index1~0 .cse2 .cse3 .cse1 4294967296) 4294967296))) .cse6))) (and .cse0 (<= (+ .cse1 1) c_main_~main__index2~0) (<= c_main_~main__index2~0 (+ .cse1 99999)) (or (and .cse0 (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 .cse2 .cse3 99997) 4294967296)) 100000))) (<= (+ (* 4294967296 (div (+ .cse4 c_main_~main__index1~0 .cse2 (* 4294967296 (div (+ c_main_~main__index2~0 8589734594) 4294967296)) .cse1 4294967296) 4294967296)) .cse5) .cse6)) (<= (* 4294967296 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) c_main_~main__index2~0) (<= c_main_~main__index1~0 (+ .cse5 99999)) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)) 1) c_main_~main__index1~0))))) is different from false [2019-09-08 02:54:01,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (div c_main_~main__index1~0 4294967296))) (let ((.cse4 (* 4294967296 (div c_main_~main__index2~0 4294967296))) (.cse0 (* 4294967296 .cse6))) (and (let ((.cse1 (* (- 4294967296) .cse6)) (.cse2 (* (- 1) c_main_~main__index2~0)) (.cse5 (+ c_main_~main__index1~0 .cse4))) (or (let ((.cse3 (* 4294967296 (div (+ c_main_~main__index2~0 4294767298) 4294967296)))) (and (<= (+ .cse0 (* 4294967296 (div (+ .cse1 c_main_~main__index1~0 .cse2 .cse3 .cse4 4294967296) 4294967296))) .cse5) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 .cse2 .cse3 99997) 4294967296)) 100000)))) (<= (+ (* 4294967296 (div (+ .cse1 c_main_~main__index1~0 .cse2 (* 4294967296 (div (+ c_main_~main__index2~0 8589734594) 4294967296)) .cse4 4294967296) 4294967296)) .cse0) .cse5))) (<= (* 4294967296 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) c_main_~main__index2~0) (<= (+ c_main_~main__index1~0 .cse4 1) (+ .cse0 c_main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)) 1) c_main_~main__index1~0)))) is different from false [2019-09-08 02:54:04,087 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_main_~main__index1~0 4294967296))) (let ((.cse2 (* (- 1) c_main_~main__index2~0)) (.cse0 (* 4294967296 .cse1)) (.cse3 (* 4294967296 (div c_main_~main__index2~0 4294967296)))) (and (<= (+ .cse0 (* 4294967296 (div (+ (* (- 4294967296) .cse1) c_main_~main__index1~0 .cse2 (* 4294967296 (div (+ c_main_~main__index2~0 4294767298) 4294967296)) .cse3 4294967296) 4294967296))) (+ c_main_~main__index1~0 .cse3)) (<= (+ .cse3 1) c_main_~main__index2~0) (<= c_main_~main__index2~0 (+ .cse3 99999)) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 .cse2 .cse3 4294967294) 4294967296)) 1) c_main_~main__index1~0) (<= (* 4294967296 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) c_main_~main__index2~0) (<= c_main_~main__index1~0 (+ .cse0 99999)) (<= c_main_~main__index2~0 (+ .cse3 99997)) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)) 1) c_main_~main__index1~0)))) is different from false [2019-09-08 02:54:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:04,125 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-09-08 02:54:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:54:04,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-09-08 02:54:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:04,126 INFO L225 Difference]: With dead ends: 32 [2019-09-08 02:54:04,126 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:54:04,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=53, Invalid=112, Unknown=11, NotChecked=130, Total=306 [2019-09-08 02:54:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:54:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:54:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:54:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:54:04,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-08 02:54:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:04,128 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:54:04,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 02:54:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:54:04,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:54:04,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:54:15,039 WARN L188 SmtUtils]: Spent 10.85 s on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 02:54:20,722 WARN L188 SmtUtils]: Spent 5.68 s on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-08 02:54:28,212 WARN L188 SmtUtils]: Spent 7.49 s on a formula simplification. DAG size of input: 67 DAG size of output: 29 [2019-09-08 02:54:28,306 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:54:28,306 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:54:28,307 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:54:28,307 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:54:28,307 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:54:28,307 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:54:28,307 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:54:28,307 INFO L446 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-09-08 02:54:28,307 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2019-09-08 02:54:28,308 INFO L439 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse5 (div main_~main__index2~0 4294967296)) (.cse6 (div main_~main__index1~0 4294967296))) (or (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse3 (select .cse4 (+ (* (- 17179869184) .cse6) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse1 (select .cse4 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse5))))) (let ((.cse2 (+ .cse3 (* 4294967296 (div .cse1 4294967296)))) (.cse0 (* 4294967296 (div .cse3 4294967296)))) (and (<= (+ .cse0 .cse1) .cse2) (< .cse2 (+ .cse0 .cse1 1)))))) (<= (+ main_~main__index1~0 (* 4294967296 .cse5)) (+ (* 4294967296 .cse6) main_~main__index2~0))))) (= main_~main__loop_entered~0 0)) [2019-09-08 02:54:28,308 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-09-08 02:54:28,308 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-09-08 02:54:28,308 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__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) .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-08 02:54:28,309 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-09-08 02:54:28,309 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-09-08 02:54:28,309 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-09-08 02:54:28,309 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (* 4294967296 (div (+ main_~main__index2~0 4294867297) 4294967296)) main_~main__index2~0) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ main_~main__index1~0 4294867295) 4294967296)) 1) main_~main__index1~0)) [2019-09-08 02:54:28,309 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-09-08 02:54:28,309 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-09-08 02:54:28,309 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-08 02:54:28,310 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-09-08 02:54:28,310 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-08 02:54:28,310 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-08 02:54:28,310 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-09-08 02:54:28,310 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-09-08 02:54:28,310 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-09-08 02:54:28,310 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-09-08 02:54:28,311 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-08 02:54:28,311 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2019-09-08 02:54:28,311 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2019-09-08 02:54:28,311 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-09-08 02:54:28,311 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-09-08 02:54:28,311 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-09-08 02:54:28,312 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-08 02:54:28,312 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-08 02:54:28,312 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-09-08 02:54:28,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,327 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:54:28 BoogieIcfgContainer [2019-09-08 02:54:28,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:54:28,351 INFO L168 Benchmark]: Toolchain (without parser) took 89725.01 ms. Allocated memory was 135.3 MB in the beginning and 253.8 MB in the end (delta: 118.5 MB). Free memory was 90.8 MB in the beginning and 135.7 MB in the end (delta: -44.9 MB). Peak memory consumption was 73.6 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:28,352 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:54:28,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.45 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 90.6 MB in the beginning and 177.4 MB in the end (delta: -86.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:28,354 INFO L168 Benchmark]: Boogie Preprocessor took 32.36 ms. Allocated memory is still 200.8 MB. Free memory was 177.4 MB in the beginning and 175.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:28,354 INFO L168 Benchmark]: RCFGBuilder took 359.18 ms. Allocated memory is still 200.8 MB. Free memory was 175.7 MB in the beginning and 157.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:28,355 INFO L168 Benchmark]: TraceAbstraction took 88956.13 ms. Allocated memory was 200.8 MB in the beginning and 253.8 MB in the end (delta: 53.0 MB). Free memory was 156.9 MB in the beginning and 135.7 MB in the end (delta: 21.2 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:28,360 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.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.45 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 90.6 MB in the beginning and 177.4 MB in the end (delta: -86.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.36 ms. Allocated memory is still 200.8 MB. Free memory was 177.4 MB in the beginning and 175.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.18 ms. Allocated memory is still 200.8 MB. Free memory was 175.7 MB in the beginning and 157.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88956.13 ms. Allocated memory was 200.8 MB in the beginning and 253.8 MB in the end (delta: 53.0 MB). Free memory was 156.9 MB in the beginning and 135.7 MB in the end (delta: 21.2 MB). Peak memory consumption was 74.2 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 * 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-08 02:54:28,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __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-08 02:54:28,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:54:28,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __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)) && 4294967296 * ((main__index2 + 4294867297) / 4294967296) <= main__index2) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && 4294967296 * ((main__index1 + 4294867295) / 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, 88.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 24.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 216 SDtfs, 194 SDslu, 321 SDs, 0 SdLazy, 200 SolverSat, 23 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 49.8s 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, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 24 NumberOfFragments, 541 HoareAnnotationTreeSize, 12 FomulaSimplifications, 889 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 776 FormulaSimplificationTreeSizeReductionInter, 24.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 84679 SizeOfPredicates, 4 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 7/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...