/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 11:41:09,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 11:41:09,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 11:41:09,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 11:41:09,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 11:41:09,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 11:41:09,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 11:41:09,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 11:41:09,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 11:41:09,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 11:41:09,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 11:41:09,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 11:41:09,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 11:41:09,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 11:41:09,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 11:41:09,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 11:41:09,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 11:41:09,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 11:41:09,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 11:41:09,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 11:41:09,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 11:41:09,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 11:41:09,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 11:41:09,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 11:41:09,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 11:41:09,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 11:41:09,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 11:41:09,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 11:41:09,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 11:41:09,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 11:41:09,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 11:41:09,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 11:41:09,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 11:41:09,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 11:41:09,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 11:41:09,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 11:41:09,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 11:41:09,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 11:41:09,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 11:41:09,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 11:41:09,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 11:41:09,680 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 [2020-07-21 11:41:09,696 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 11:41:09,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 11:41:09,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 11:41:09,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 11:41:09,699 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 11:41:09,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 11:41:09,699 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 11:41:09,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 11:41:09,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 11:41:09,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 11:41:09,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 11:41:09,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 11:41:09,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 11:41:09,701 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 11:41:09,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 11:41:09,702 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 11:41:09,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 11:41:09,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 11:41:09,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 11:41:09,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 11:41:09,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 11:41:09,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 11:41:09,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 11:41:09,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 11:41:09,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 11:41:09,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 11:41:09,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:09,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 11:41:09,705 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 11:41:09,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-21 11:41:10,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 11:41:10,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 11:41:10,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 11:41:10,057 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 11:41:10,060 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 11:41:10,061 INFO L429 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 [2020-07-21 11:41:10,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42774a7d0/0bd2355709184862b7b860c996b397c0/FLAGfe0f4c2b2 [2020-07-21 11:41:10,771 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 11:41:10,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2020-07-21 11:41:10,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42774a7d0/0bd2355709184862b7b860c996b397c0/FLAGfe0f4c2b2 [2020-07-21 11:41:11,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42774a7d0/0bd2355709184862b7b860c996b397c0 [2020-07-21 11:41:11,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 11:41:11,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 11:41:11,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 11:41:11,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 11:41:11,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 11:41:11,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b073ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11, skipping insertion in model container [2020-07-21 11:41:11,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 11:41:11,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 11:41:11,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 11:41:11,412 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 11:41:11,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 11:41:11,460 INFO L208 MainTranslator]: Completed translation [2020-07-21 11:41:11,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11 WrapperNode [2020-07-21 11:41:11,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 11:41:11,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 11:41:11,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 11:41:11,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 11:41:11,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (1/1) ... [2020-07-21 11:41:11,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 11:41:11,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 11:41:11,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 11:41:11,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 11:41:11,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (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 [2020-07-21 11:41:11,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 11:41:11,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 11:41:11,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 11:41:11,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 11:41:11,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 11:41:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 11:41:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 11:41:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 11:41:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 11:41:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-21 11:41:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 11:41:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-21 11:41:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-21 11:41:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 11:41:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 11:41:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 11:41:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-21 11:41:12,071 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 11:41:12,071 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-21 11:41:12,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:41:12 BoogieIcfgContainer [2020-07-21 11:41:12,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 11:41:12,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 11:41:12,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 11:41:12,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 11:41:12,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:41:11" (1/3) ... [2020-07-21 11:41:12,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d78305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:41:12, skipping insertion in model container [2020-07-21 11:41:12,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:41:11" (2/3) ... [2020-07-21 11:41:12,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d78305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:41:12, skipping insertion in model container [2020-07-21 11:41:12,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:41:12" (3/3) ... [2020-07-21 11:41:12,099 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2020-07-21 11:41:12,109 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 11:41:12,118 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 11:41:12,135 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 11:41:12,166 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 11:41:12,166 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 11:41:12,166 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 11:41:12,167 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 11:41:12,167 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 11:41:12,167 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 11:41:12,167 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 11:41:12,168 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 11:41:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-21 11:41:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 11:41:12,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:41:12,200 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:41:12,200 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:41:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:41:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1561713717, now seen corresponding path program 1 times [2020-07-21 11:41:12,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:41:12,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389712392] [2020-07-21 11:41:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:41:12,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 11:41:12,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:41:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 11:41:12,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:41:12,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [389712392] [2020-07-21 11:41:12,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:41:12,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 11:41:12,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431239002] [2020-07-21 11:41:12,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 11:41:12,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:41:12,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 11:41:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 11:41:12,377 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-07-21 11:41:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:41:12,408 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2020-07-21 11:41:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 11:41:12,410 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-21 11:41:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:41:12,422 INFO L225 Difference]: With dead ends: 59 [2020-07-21 11:41:12,423 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 11:41:12,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 11:41:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 11:41:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-21 11:41:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-21 11:41:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-21 11:41:12,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2020-07-21 11:41:12,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:41:12,488 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-21 11:41:12,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 11:41:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-21 11:41:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 11:41:12,491 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:41:12,491 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:41:12,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:12,706 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:41:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:41:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -258750159, now seen corresponding path program 1 times [2020-07-21 11:41:12,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:41:12,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956420210] [2020-07-21 11:41:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:41:12,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 11:41:12,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:41:12,876 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:41:12,878 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:41:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-21 11:41:12,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:41:12,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956420210] [2020-07-21 11:41:12,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:41:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-21 11:41:12,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360499222] [2020-07-21 11:41:12,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 11:41:12,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:41:12,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 11:41:12,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-21 11:41:12,955 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2020-07-21 11:41:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:41:13,213 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-21 11:41:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 11:41:13,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-21 11:41:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:41:13,216 INFO L225 Difference]: With dead ends: 37 [2020-07-21 11:41:13,217 INFO L226 Difference]: Without dead ends: 35 [2020-07-21 11:41:13,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-21 11:41:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-21 11:41:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-21 11:41:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-21 11:41:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-21 11:41:13,233 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2020-07-21 11:41:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:41:13,234 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-21 11:41:13,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 11:41:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-21 11:41:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 11:41:13,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:41:13,236 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:41:13,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:13,452 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:41:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:41:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1843057556, now seen corresponding path program 1 times [2020-07-21 11:41:13,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:41:13,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81051255] [2020-07-21 11:41:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:41:13,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 11:41:13,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:41:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-21 11:41:13,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:41:13,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81051255] [2020-07-21 11:41:13,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:41:13,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 11:41:13,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903885244] [2020-07-21 11:41:13,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 11:41:13,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:41:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 11:41:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 11:41:13,521 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2020-07-21 11:41:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:41:13,538 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-07-21 11:41:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 11:41:13,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-21 11:41:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:41:13,541 INFO L225 Difference]: With dead ends: 47 [2020-07-21 11:41:13,541 INFO L226 Difference]: Without dead ends: 37 [2020-07-21 11:41:13,542 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 11:41:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-21 11:41:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2020-07-21 11:41:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-21 11:41:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-21 11:41:13,552 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2020-07-21 11:41:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:41:13,553 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-21 11:41:13,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 11:41:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-21 11:41:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-21 11:41:13,555 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:41:13,555 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2020-07-21 11:41:13,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:13,770 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:41:13,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:41:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash -506278145, now seen corresponding path program 1 times [2020-07-21 11:41:13,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:41:13,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [258510681] [2020-07-21 11:41:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:41:13,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-21 11:41:13,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:41:14,224 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,238 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,240 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,245 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,251 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,259 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:41:14,321 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-21 11:41:14,321 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:41:14,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:41:14,338 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:41:14,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:41:14,344 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:41:14,351 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:41:14,358 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:41:14,369 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 14 [2020-07-21 11:41:14,371 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:41:14,380 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-21 11:41:14,381 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 11:41:14,394 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-21 11:41:14,394 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-21 11:41:16,543 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-07-21 11:41:16,545 INFO L624 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2020-07-21 11:41:16,549 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:41:16,549 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:381, output treesize:7 [2020-07-21 11:41:16,594 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:41:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-21 11:41:16,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:41:16,729 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:16,770 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 11:41:16,771 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:16,773 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 1] term [2020-07-21 11:41:16,774 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,016 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2020-07-21 11:41:17,261 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 11:41:17,262 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,502 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,504 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,516 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,518 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,529 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,531 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,532 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,544 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,546 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,557 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,558 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,569 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,571 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,572 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,584 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,585 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,596 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,597 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,609 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,610 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,621 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,622 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:17,632 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 11:41:17,634 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:41:56,122 WARN L193 SmtUtils]: Spent 37.67 s on a formula simplification. DAG size of input: 269 DAG size of output: 78 [2020-07-21 11:42:18,730 WARN L193 SmtUtils]: Spent 18.30 s on a formula simplification that was a NOOP. DAG size: 130 [2020-07-21 11:42:47,436 WARN L193 SmtUtils]: Spent 24.48 s on a formula simplification that was a NOOP. DAG size: 132 [2020-07-21 11:42:47,443 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 11:42:47,443 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,444 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 1] term [2020-07-21 11:42:47,445 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,447 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,448 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,449 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,450 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,452 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,453 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,455 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,456 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,458 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,460 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:47,461 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:49,575 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:49,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:42:49,582 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:49,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:42:51,669 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (+ (* (mod (+ main_~index1~0 1) 4294967296) 4) |main_~#array~0.offset| (- 17179869184))) (select .cse0 (+ (* (mod main_~index2~0 4294967296) 4) |main_~#array~0.offset| (- 17179869184))))) [2020-07-21 11:42:51,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:42:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:42:51,719 INFO L244 Elim1Store]: Index analysis took 2145 ms [2020-07-21 11:42:51,721 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 16 [2020-07-21 11:42:51,732 INFO L544 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-21 11:42:51,754 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,755 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,767 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,769 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,773 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,775 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,802 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 16 [2020-07-21 11:42:51,807 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:51,826 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,828 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,831 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,832 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,833 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:51,857 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:42:51,858 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 38 [2020-07-21 11:42:51,863 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:51,869 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:53,952 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-21 11:42:53,953 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:53,966 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:53,967 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:53,970 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:53,972 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:53,973 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:53,995 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:42:53,996 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2020-07-21 11:42:53,997 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,009 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:54,025 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-21 11:42:54,025 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:54,044 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:54,046 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:54,057 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:54,151 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:42:54,152 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 80 [2020-07-21 11:42:54,154 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,155 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,157 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,157 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,159 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,161 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,164 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,166 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 11:42:54,166 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,167 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,168 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,169 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,171 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,175 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,176 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,178 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,179 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,180 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,182 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,187 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,189 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,190 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,191 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,192 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,195 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,198 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,200 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,201 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,202 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,203 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,205 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,208 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,210 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,212 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,213 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,214 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,215 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,219 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,221 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,223 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,224 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,225 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,226 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,227 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,231 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,232 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 11:42:54,233 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,234 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,235 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,236 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,238 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,241 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,243 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,244 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,245 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,247 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,248 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,252 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,254 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,255 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,255 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,256 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,258 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,261 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,263 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,264 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,264 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,266 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,267 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,271 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,272 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,273 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,274 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,275 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,277 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,280 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:54,282 INFO L544 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 11:42:54,298 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-21 11:42:54,298 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:54,313 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:54,318 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:54,328 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:42:56,491 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 45 [2020-07-21 11:42:56,492 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:42:56,492 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 86 [2020-07-21 11:42:56,494 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,495 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,496 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,497 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,498 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,500 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,509 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,510 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 11:42:56,511 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,511 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,512 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,513 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,515 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,520 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,521 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,522 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,522 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,528 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,530 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,535 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,536 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,537 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,538 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,540 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,542 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,547 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,548 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,549 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,550 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,551 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,552 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,558 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,559 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,560 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,560 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,562 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,563 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,568 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,570 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,571 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,573 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,574 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,575 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,577 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,580 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,581 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 11:42:56,581 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,582 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,583 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,584 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,585 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,590 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,591 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,592 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,592 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,594 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,595 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,600 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,601 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,602 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,603 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,604 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,605 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,611 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,612 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,613 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,614 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,616 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,617 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,621 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,623 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,623 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,624 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,626 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,627 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,632 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:42:56,633 INFO L544 ElimStorePlain]: Start of recursive call 10: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 11:42:56,652 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-21 11:42:56,652 INFO L544 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:56,669 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-21 11:42:56,670 INFO L544 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-07-21 11:42:56,684 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-21 11:42:56,684 INFO L544 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-07-21 11:43:30,793 WARN L193 SmtUtils]: Spent 34.11 s on a formula simplification. DAG size of input: 146 DAG size of output: 104 [2020-07-21 11:43:30,795 INFO L624 ElimStorePlain]: treesize reduction 202, result has 48.9 percent of original size [2020-07-21 11:43:30,797 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:43:30,818 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:43:30,825 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2020-07-21 11:43:30,826 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:1149, output treesize:121 [2020-07-21 11:43:39,673 WARN L193 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 50 DAG size of output: 22 [2020-07-21 11:43:39,709 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-07-21 11:43:39,710 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:43:41,941 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2020-07-21 11:43:41,945 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-07-21 11:43:41,946 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-07-21 11:43:41,956 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-07-21 11:43:41,963 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 11:43:41,964 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 11:43:41,966 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-07-21 11:43:41,968 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-07-21 11:43:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-21 11:43:46,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [258510681] [2020-07-21 11:43:46,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:43:46,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2020-07-21 11:43:46,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219956549] [2020-07-21 11:43:46,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-21 11:43:46,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:43:46,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-21 11:43:46,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=428, Unknown=4, NotChecked=0, Total=506 [2020-07-21 11:43:46,471 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 23 states. [2020-07-21 11:43:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:43:54,127 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-21 11:43:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-21 11:43:54,128 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2020-07-21 11:43:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:43:54,128 INFO L225 Difference]: With dead ends: 41 [2020-07-21 11:43:54,128 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 11:43:54,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 102.1s TimeCoverageRelationStatistics Valid=110, Invalid=642, Unknown=4, NotChecked=0, Total=756 [2020-07-21 11:43:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 11:43:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 11:43:54,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 11:43:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 11:43:54,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-07-21 11:43:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:43:54,131 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 11:43:54,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-21 11:43:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 11:43:54,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 11:43:54,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:43:54,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 11:43:54,586 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2020-07-21 11:43:58,954 WARN L193 SmtUtils]: Spent 4.28 s on a formula simplification that was a NOOP. DAG size: 63 [2020-07-21 11:43:58,962 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 11:43:58,962 INFO L271 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2020-07-21 11:43:58,962 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 11:43:58,962 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 11:43:58,963 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-21 11:43:58,963 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 11:43:58,963 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 11:43:58,963 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2020-07-21 11:43:58,963 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-21 11:43:58,963 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-21 11:43:58,963 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-21 11:43:58,963 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 22 50) no Hoare annotation was computed. [2020-07-21 11:43:58,964 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 22 50) no Hoare annotation was computed. [2020-07-21 11:43:58,964 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (let ((.cse1 (+ main_~index2~0 1))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse0 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse0 (+ (* (mod .cse1 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (< (mod .cse1 4294967296) 100000) (= (mod |main_#t~mem7| 4294967296) (mod |main_#t~mem6| 4294967296)) (< (mod (+ main_~index1~0 4294967295) 4294967296) (mod .cse1 4294967296)))) [2020-07-21 11:43:58,964 INFO L268 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-07-21 11:43:58,964 INFO L268 CegarLoopResult]: For program point L42(lines 42 48) no Hoare annotation was computed. [2020-07-21 11:43:58,965 INFO L264 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (and (= (select .cse0 (+ (* (mod main_~index1~0 4294967296) 4) |main_~#array~0.offset|)) |main_#t~mem2|) (< (mod main_~index1~0 4294967296) (mod main_~index2~0 4294967296)) (= |main_#t~mem3| (select .cse0 (+ (* (mod main_~index2~0 4294967296) 4) |main_~#array~0.offset|))) (< (mod main_~index2~0 4294967296) 100000))) [2020-07-21 11:43:58,965 INFO L268 CegarLoopResult]: For program point L36-1(line 36) no Hoare annotation was computed. [2020-07-21 11:43:58,965 INFO L264 CegarLoopResult]: At program point L34-1(lines 32 40) the Hoare annotation is: (or (let ((.cse1 (+ main_~index2~0 1))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse0 (+ (* (mod .cse1 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse0 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (< (mod .cse1 4294967296) 100000) (< (mod (+ main_~index1~0 4294967295) 4294967296) (mod .cse1 4294967296)))) (and (= 0 main_~loop_entered~0) (< (mod main_~index2~0 4294967296) 100000))) [2020-07-21 11:43:58,965 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (= 0 main_~loop_entered~0) [2020-07-21 11:43:58,965 INFO L268 CegarLoopResult]: For program point L34-2(lines 23 50) no Hoare annotation was computed. [2020-07-21 11:43:58,966 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (= 0 main_~loop_entered~0) [2020-07-21 11:43:58,966 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 22 50) the Hoare annotation is: true [2020-07-21 11:43:58,966 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-21 11:43:58,966 INFO L264 CegarLoopResult]: At program point L43-2(lines 43 47) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (or (and (< (mod main_~index2~0 4294967296) 100000) (< (mod main_~index1~0 4294967296) (mod main_~index2~0 4294967296)) (= (mod (select .cse0 (+ (* (mod main_~index1~0 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse0 (+ (* (mod main_~index2~0 4294967296) 4) |main_~#array~0.offset|)) 4294967296))) (let ((.cse1 (+ main_~index2~0 1))) (and (= (mod (select .cse0 (+ (* (mod (+ main_~index1~0 4294967295) 4294967296) 4) |main_~#array~0.offset|)) 4294967296) (mod (select .cse0 (+ (* (mod .cse1 4294967296) 4) |main_~#array~0.offset|)) 4294967296)) (< (mod .cse1 4294967296) 100000) (< (mod (+ main_~index1~0 4294967295) 4294967296) (mod .cse1 4294967296)))))) [2020-07-21 11:43:58,966 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (< (mod main_~index1~0 4294967296) (mod main_~index2~0 4294967296)) (< (mod main_~index2~0 4294967296) 100000)) [2020-07-21 11:43:58,967 INFO L268 CegarLoopResult]: For program point L35-1(line 35) no Hoare annotation was computed. [2020-07-21 11:43:58,967 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-21 11:43:58,967 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-21 11:43:58,967 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-21 11:43:58,967 INFO L268 CegarLoopResult]: For program point L14-2(lines 12 18) no Hoare annotation was computed. [2020-07-21 11:43:58,967 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-21 11:43:58,968 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-21 11:43:58,983 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,984 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,992 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:58,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:43:59 BoogieIcfgContainer [2020-07-21 11:43:59,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 11:43:59,005 INFO L168 Benchmark]: Toolchain (without parser) took 167884.04 ms. Allocated memory was 143.7 MB in the beginning and 283.1 MB in the end (delta: 139.5 MB). Free memory was 101.2 MB in the beginning and 113.3 MB in the end (delta: -12.1 MB). Peak memory consumption was 127.3 MB. Max. memory is 7.1 GB. [2020-07-21 11:43:59,006 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 143.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-21 11:43:59,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.37 ms. Allocated memory is still 143.7 MB. Free memory was 101.0 MB in the beginning and 90.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-21 11:43:59,008 INFO L168 Benchmark]: Boogie Preprocessor took 153.45 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-21 11:43:59,009 INFO L168 Benchmark]: RCFGBuilder took 463.60 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 162.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2020-07-21 11:43:59,010 INFO L168 Benchmark]: TraceAbstraction took 166912.76 ms. Allocated memory was 201.3 MB in the beginning and 283.1 MB in the end (delta: 81.8 MB). Free memory was 162.4 MB in the beginning and 113.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 130.8 MB. Max. memory is 7.1 GB. [2020-07-21 11:43:59,015 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 143.7 MB. Free memory was 119.8 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 338.37 ms. Allocated memory is still 143.7 MB. Free memory was 101.0 MB in the beginning and 90.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.45 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 463.60 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 162.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 166912.76 ms. Allocated memory was 201.3 MB in the beginning and 283.1 MB in the end (delta: 81.8 MB). Free memory was 162.4 MB in the beginning and 113.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 130.8 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant [2020-07-21 11:43:59,037 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,037 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 && (index2 + 1) % 4294967296 < 100000) && (index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296) || (0 == loop_entered && index2 % 4294967296 < 100000) - InvariantResult [Line: 43]: Loop Invariant [2020-07-21 11:43:59,045 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,046 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,047 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,048 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-21 11:43:59,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((index2 % 4294967296 < 100000 && index1 % 4294967296 < index2 % 4294967296) && unknown-#memory_int-unknown[array][index1 % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][index2 % 4294967296 * 4 + array] % 4294967296) || ((unknown-#memory_int-unknown[array][(index1 + 4294967295) % 4294967296 * 4 + array] % 4294967296 == unknown-#memory_int-unknown[array][(index2 + 1) % 4294967296 * 4 + array] % 4294967296 && (index2 + 1) % 4294967296 < 100000) && (index1 + 4294967295) % 4294967296 < (index2 + 1) % 4294967296) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 162.1s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 31 SDslu, 344 SDs, 0 SdLazy, 338 SolverSat, 15 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 102.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 22 PreInvPairs, 30 NumberOfFragments, 272 HoareAnnotationTreeSize, 22 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 152.7s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 137 ConstructedInterpolants, 3 QuantifiedInterpolants, 60585 SizeOfPredicates, 20 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 40/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...