/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/array-fpi/eqn2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 11:37:33,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 11:37:33,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 11:37:33,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 11:37:33,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 11:37:33,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 11:37:33,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 11:37:33,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 11:37:33,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 11:37:33,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 11:37:33,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 11:37:33,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 11:37:33,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 11:37:33,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 11:37:33,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 11:37:33,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 11:37:33,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 11:37:33,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 11:37:33,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 11:37:33,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 11:37:33,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 11:37:33,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 11:37:33,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 11:37:33,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 11:37:33,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 11:37:33,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 11:37:33,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 11:37:33,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 11:37:33,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 11:37:33,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 11:37:33,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 11:37:33,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 11:37:33,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 11:37:33,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 11:37:33,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 11:37:33,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 11:37:33,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 11:37:33,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 11:37:33,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 11:37:33,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 11:37:33,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 11:37:33,808 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:37:33,830 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 11:37:33,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 11:37:33,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 11:37:33,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 11:37:33,832 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 11:37:33,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 11:37:33,833 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 11:37:33,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 11:37:33,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 11:37:33,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 11:37:33,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 11:37:33,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 11:37:33,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 11:37:33,835 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 11:37:33,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 11:37:33,835 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 11:37:33,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 11:37:33,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 11:37:33,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 11:37:33,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 11:37:33,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 11:37:33,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 11:37:33,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 11:37:33,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 11:37:33,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 11:37:33,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 11:37:33,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:33,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 11:37:33,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 11:37:33,838 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:37:34,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 11:37:34,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 11:37:34,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 11:37:34,127 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 11:37:34,127 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 11:37:34,128 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-21 11:37:34,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d174055/3c923a068d0c4a17b11cd47aff71cec8/FLAG6a598c2bb [2020-07-21 11:37:34,669 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 11:37:34,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-21 11:37:34,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d174055/3c923a068d0c4a17b11cd47aff71cec8/FLAG6a598c2bb [2020-07-21 11:37:35,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d174055/3c923a068d0c4a17b11cd47aff71cec8 [2020-07-21 11:37:35,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 11:37:35,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 11:37:35,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 11:37:35,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 11:37:35,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 11:37:35,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bad72a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35, skipping insertion in model container [2020-07-21 11:37:35,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 11:37:35,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 11:37:35,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 11:37:35,330 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 11:37:35,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 11:37:35,369 INFO L208 MainTranslator]: Completed translation [2020-07-21 11:37:35,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35 WrapperNode [2020-07-21 11:37:35,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 11:37:35,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 11:37:35,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 11:37:35,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 11:37:35,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (1/1) ... [2020-07-21 11:37:35,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 11:37:35,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 11:37:35,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 11:37:35,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 11:37:35,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (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:37:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 11:37:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 11:37:35,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 11:37:35,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 11:37:35,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 11:37:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 11:37:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 11:37:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 11:37:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 11:37:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 11:37:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-21 11:37:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 11:37:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-21 11:37:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-21 11:37:35,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-21 11:37:35,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 11:37:35,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 11:37:35,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 11:37:35,835 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 11:37:35,836 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-21 11:37:35,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:35 BoogieIcfgContainer [2020-07-21 11:37:35,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 11:37:35,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 11:37:35,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 11:37:35,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 11:37:35,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:37:35" (1/3) ... [2020-07-21 11:37:35,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b9448a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:35, skipping insertion in model container [2020-07-21 11:37:35,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:35" (2/3) ... [2020-07-21 11:37:35,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b9448a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:35, skipping insertion in model container [2020-07-21 11:37:35,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:35" (3/3) ... [2020-07-21 11:37:35,850 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-21 11:37:35,864 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 11:37:35,871 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 11:37:35,887 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 11:37:35,914 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 11:37:35,914 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 11:37:35,914 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 11:37:35,914 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 11:37:35,914 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 11:37:35,915 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 11:37:35,915 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 11:37:35,915 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 11:37:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-21 11:37:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 11:37:35,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:35,947 INFO L422 BasicCegarLoop]: trace histogram [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:37:35,947 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-21 11:37:35,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:35,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459623621] [2020-07-21 11:37:35,960 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:37:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:36,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 11:37:36,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:36,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:37:36,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459623621] [2020-07-21 11:37:36,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:37:36,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 11:37:36,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132545510] [2020-07-21 11:37:36,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 11:37:36,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 11:37:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 11:37:36,131 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-21 11:37:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:36,157 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-21 11:37:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 11:37:36,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-21 11:37:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:36,168 INFO L225 Difference]: With dead ends: 58 [2020-07-21 11:37:36,168 INFO L226 Difference]: Without dead ends: 29 [2020-07-21 11:37:36,172 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:37:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-21 11:37:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-21 11:37:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-21 11:37:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-21 11:37:36,214 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-21 11:37:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:36,215 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-21 11:37:36,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 11:37:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-21 11:37:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 11:37:36,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:36,217 INFO L422 BasicCegarLoop]: trace histogram [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:37:36,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:36,422 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-21 11:37:36,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:36,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035199391] [2020-07-21 11:37:36,425 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:37:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:36,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 11:37:36,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:36,603 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:36,604 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-21 11:37:36,608 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:36,644 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-21 11:37:36,647 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:37:36,649 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-21 11:37:36,692 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:36,693 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-21 11:37:36,694 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 11:37:36,706 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-21 11:37:36,707 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:37:36,707 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-21 11:37:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:36,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:37:36,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2035199391] [2020-07-21 11:37:36,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:37:36,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-21 11:37:36,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029890091] [2020-07-21 11:37:36,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 11:37:36,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 11:37:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-21 11:37:36,743 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-21 11:37:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:36,863 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-21 11:37:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 11:37:36,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-21 11:37:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:36,867 INFO L225 Difference]: With dead ends: 47 [2020-07-21 11:37:36,867 INFO L226 Difference]: Without dead ends: 45 [2020-07-21 11:37:36,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-21 11:37:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-21 11:37:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-21 11:37:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 11:37:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-21 11:37:36,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-21 11:37:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:36,883 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-21 11:37:36,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 11:37:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-21 11:37:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 11:37:36,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:36,885 INFO L422 BasicCegarLoop]: trace histogram [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:37:37,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:37,098 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-21 11:37:37,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:37,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24117853] [2020-07-21 11:37:37,100 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:37:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:37,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 11:37:37,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:37,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:37:37,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24117853] [2020-07-21 11:37:37,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:37:37,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 11:37:37,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268269243] [2020-07-21 11:37:37,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 11:37:37,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:37,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 11:37:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 11:37:37,199 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-21 11:37:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:37,287 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-21 11:37:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 11:37:37,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-21 11:37:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:37,291 INFO L225 Difference]: With dead ends: 71 [2020-07-21 11:37:37,291 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 11:37:37,292 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-21 11:37:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 11:37:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-21 11:37:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 11:37:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-21 11:37:37,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-21 11:37:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:37,305 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-21 11:37:37,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 11:37:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-21 11:37:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 11:37:37,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:37,309 INFO L422 BasicCegarLoop]: trace histogram [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:37:37,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:37,523 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-21 11:37:37,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:37,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660477970] [2020-07-21 11:37:37,526 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:37:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:37,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 11:37:37,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:37,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:37:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:37,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660477970] [2020-07-21 11:37:37,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:37:37,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 11:37:37,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267773972] [2020-07-21 11:37:37,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 11:37:37,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 11:37:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 11:37:37,627 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-21 11:37:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:37,755 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-21 11:37:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 11:37:37,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-21 11:37:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:37,757 INFO L225 Difference]: With dead ends: 66 [2020-07-21 11:37:37,757 INFO L226 Difference]: Without dead ends: 55 [2020-07-21 11:37:37,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-21 11:37:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-21 11:37:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-21 11:37:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-21 11:37:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-21 11:37:37,766 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-21 11:37:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:37,766 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-21 11:37:37,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 11:37:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-21 11:37:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 11:37:37,767 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:37,768 INFO L422 BasicCegarLoop]: trace histogram [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:37:37,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:37,969 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-21 11:37:37,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:37,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350260730] [2020-07-21 11:37:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:38,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 11:37:38,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:38,034 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-21 11:37:38,035 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:38,040 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:38,046 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 11:37:38,046 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:38,051 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:38,052 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:37:38,052 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 11:37:38,118 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 11:37:38,119 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-21 11:37:38,121 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:38,154 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 11:37:38,156 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:38,159 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 11:37:38,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 11:37:38,160 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:38,181 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:38,202 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:38,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:38,282 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-21 11:37:38,283 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:38,296 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_2], 20=[|v_#memory_int_16|]} [2020-07-21 11:37:38,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:38,310 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-21 11:37:38,311 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-21 11:37:38,313 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:38,352 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:38,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:38,382 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-21 11:37:38,382 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-21 11:37:38,385 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:38,456 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-21 11:37:38,462 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-21 11:37:38,462 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-21 11:37:39,898 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-21 11:37:43,660 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-21 11:37:43,667 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:43,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:43,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:43,720 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:37:43,724 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:37:43,752 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-21 11:37:43,753 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 47 [2020-07-21 11:37:43,756 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:37:43,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:43,761 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:43,799 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-21 11:37:43,800 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 43 [2020-07-21 11:37:43,802 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-21 11:37:43,836 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-21 11:37:43,837 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:37:43,838 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-21 11:37:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:43,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:37:43,974 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:37:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:49,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350260730] [2020-07-21 11:37:49,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:37:49,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-21 11:37:49,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352871414] [2020-07-21 11:37:49,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 11:37:49,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:49,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 11:37:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=166, Unknown=4, NotChecked=0, Total=210 [2020-07-21 11:37:49,756 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2020-07-21 11:37:56,739 WARN L193 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-21 11:38:03,224 WARN L193 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-07-21 11:38:13,803 WARN L193 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-21 11:38:18,479 WARN L193 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-21 11:38:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:38:21,659 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2020-07-21 11:38:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-21 11:38:21,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-21 11:38:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:38:21,665 INFO L225 Difference]: With dead ends: 101 [2020-07-21 11:38:21,665 INFO L226 Difference]: Without dead ends: 99 [2020-07-21 11:38:21,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=165, Invalid=700, Unknown=5, NotChecked=0, Total=870 [2020-07-21 11:38:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-21 11:38:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2020-07-21 11:38:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 11:38:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-07-21 11:38:21,680 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 26 [2020-07-21 11:38:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:38:21,680 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-07-21 11:38:21,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 11:38:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-21 11:38:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 11:38:21,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:38:21,682 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, 1, 1, 1, 1, 1, 1] [2020-07-21 11:38:21,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:21,894 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:38:21,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:38:21,895 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-21 11:38:21,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:38:21,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853906739] [2020-07-21 11:38:21,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:38:21,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 11:38:21,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:38:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:38:21,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:38:21,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853906739] [2020-07-21 11:38:21,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:38:21,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 11:38:21,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043323381] [2020-07-21 11:38:21,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 11:38:21,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:38:21,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 11:38:21,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 11:38:21,985 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 6 states. [2020-07-21 11:38:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:38:22,130 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2020-07-21 11:38:22,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 11:38:22,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-21 11:38:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:38:22,132 INFO L225 Difference]: With dead ends: 80 [2020-07-21 11:38:22,132 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 11:38:22,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-21 11:38:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 11:38:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2020-07-21 11:38:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 11:38:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-21 11:38:22,142 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2020-07-21 11:38:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:38:22,143 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-21 11:38:22,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 11:38:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-21 11:38:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 11:38:22,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:38:22,144 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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:38:22,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:22,360 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:38:22,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:38:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2074868861, now seen corresponding path program 2 times [2020-07-21 11:38:22,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:38:22,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002946567] [2020-07-21 11:38:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:38:22,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 11:38:22,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:38:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 11:38:22,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:38:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 11:38:22,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002946567] [2020-07-21 11:38:22,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:38:22,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-21 11:38:22,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953839707] [2020-07-21 11:38:22,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 11:38:22,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:38:22,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 11:38:22,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-21 11:38:22,485 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 9 states. [2020-07-21 11:38:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:38:22,761 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-21 11:38:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 11:38:22,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-21 11:38:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:38:22,764 INFO L225 Difference]: With dead ends: 98 [2020-07-21 11:38:22,764 INFO L226 Difference]: Without dead ends: 76 [2020-07-21 11:38:22,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 11:38:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-21 11:38:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-07-21 11:38:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 11:38:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-07-21 11:38:22,783 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2020-07-21 11:38:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:38:22,783 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-07-21 11:38:22,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 11:38:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-21 11:38:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 11:38:22,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:38:22,785 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-07-21 11:38:22,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:22,988 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:38:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:38:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-21 11:38:22,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:38:22,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [914044714] [2020-07-21 11:38:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:38:23,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-21 11:38:23,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:38:23,060 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-21 11:38:23,061 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:23,092 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:23,101 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 11:38:23,101 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:23,117 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:23,118 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:38:23,118 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 11:38:23,224 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 11:38:23,225 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-21 11:38:23,226 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:23,316 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 11:38:23,317 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:23,318 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 11:38:23,319 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 11:38:23,320 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:23,357 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:23,402 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:23,404 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:23,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:23,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:23,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:23,580 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:23,580 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2020-07-21 11:38:23,582 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:38:23,582 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:38:23,583 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:38:23,583 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:38:23,584 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:38:23,584 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:23,586 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:23,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:23,865 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-21 11:38:23,866 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-21 11:38:23,866 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2020-07-21 11:38:23,868 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-21 11:38:23,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 11:38:23,869 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 11:38:23,869 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 11:38:23,870 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:38:23,870 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:38:23,874 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:38:23,874 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:38:23,875 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:38:23,875 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:23,878 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:24,225 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2020-07-21 11:38:24,226 INFO L624 ElimStorePlain]: treesize reduction 803, result has 14.5 percent of original size [2020-07-21 11:38:24,229 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:24,230 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 2 xjuncts. [2020-07-21 11:38:24,231 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-21 11:38:24,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:24,374 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:24,499 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:24,594 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:24,954 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-21 11:38:24,956 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:38:24,978 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:24,979 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:24,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:24,985 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:25,016 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:25,053 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-21 11:38:25,054 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2020-07-21 11:38:25,056 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:25,080 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:25,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:25,085 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:25,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:25,098 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:25,119 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:25,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2020-07-21 11:38:25,150 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:25,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:25,177 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:25,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:25,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:25,185 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2020-07-21 11:38:25,188 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:25,542 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-07-21 11:38:25,542 INFO L624 ElimStorePlain]: treesize reduction 71, result has 74.9 percent of original size [2020-07-21 11:38:25,543 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-07-21 11:38:25,544 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:212 [2020-07-21 11:38:25,855 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-07-21 11:38:25,857 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-21 11:38:25,857 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:38:26,102 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-07-21 11:38:26,104 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:38:26,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,314 INFO L244 Elim1Store]: Index analysis took 169 ms [2020-07-21 11:38:26,408 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-21 11:38:26,409 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 175 [2020-07-21 11:38:26,411 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:26,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,730 INFO L244 Elim1Store]: Index analysis took 280 ms [2020-07-21 11:38:26,747 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:26,748 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 101 [2020-07-21 11:38:26,749 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:26,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:26,817 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:26,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 107 [2020-07-21 11:38:26,820 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:27,165 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-07-21 11:38:27,166 INFO L624 ElimStorePlain]: treesize reduction 210, result has 54.4 percent of original size [2020-07-21 11:38:27,172 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-07-21 11:38:27,172 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:274, output treesize:251 [2020-07-21 11:38:49,210 WARN L193 SmtUtils]: Spent 12.10 s on a formula simplification that was a NOOP. DAG size: 101 [2020-07-21 11:38:59,755 WARN L193 SmtUtils]: Spent 10.32 s on a formula simplification that was a NOOP. DAG size: 105 [2020-07-21 11:38:59,759 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:38:59,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,818 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:59,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,830 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:59,931 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-21 11:38:59,932 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 67 [2020-07-21 11:38:59,934 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:38:59,934 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:59,938 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 11:38:59,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,969 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:59,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:59,977 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:39:00,083 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-21 11:39:00,084 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-21 11:39:00,084 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 80 [2020-07-21 11:39:00,085 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,086 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,086 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:00,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,088 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,089 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,089 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:00,090 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,091 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,091 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,094 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,100 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,101 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,103 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,103 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,104 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,116 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,116 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,117 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,119 INFO L544 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 11:39:00,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:00,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:00,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:00,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:00,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:00,142 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:39:00,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:00,275 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-21 11:39:00,276 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-21 11:39:00,277 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 111 [2020-07-21 11:39:00,280 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:39:00,280 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:39:00,281 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,281 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,282 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,282 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,283 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,284 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,284 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,285 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,286 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,287 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,288 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,288 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,291 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,291 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,292 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,293 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,293 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,294 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,294 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,295 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,297 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,297 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,298 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,298 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,301 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:39:00,302 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:39:00,302 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,303 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,304 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,304 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,305 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,306 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,309 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,311 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,311 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,312 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,313 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,315 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,315 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,316 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,316 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,317 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,317 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,318 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,318 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,319 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,319 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,320 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,321 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,321 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,322 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,322 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,323 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,325 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,325 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,326 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,327 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,329 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,329 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,330 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:00,330 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:00,331 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,331 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,333 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,333 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,335 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:00,335 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:00,336 INFO L544 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-21 11:39:00,752 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2020-07-21 11:39:00,753 INFO L624 ElimStorePlain]: treesize reduction 141, result has 48.0 percent of original size [2020-07-21 11:39:00,765 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:39:00,765 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:293, output treesize:7 [2020-07-21 11:39:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:39:00,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:39:01,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:39:05,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:07,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:09,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base))) (store .cse2 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse2 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:11,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse4 (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (* main_~i~0 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse3 c_main_~b~0.offset) (select .cse4 c_main_~a~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:13,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= (select (let ((.cse4 (let ((.cse5 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4)))) (.cse6 (* v_subst_2 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse3 c_main_~b~0.offset) (select .cse4 c_main_~a~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset) 1) (< v_main_~i~0_42 2))) is different from false [2020-07-21 11:39:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-07-21 11:39:13,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [914044714] [2020-07-21 11:39:13,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:39:13,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-21 11:39:13,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489562633] [2020-07-21 11:39:13,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 11:39:13,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:39:13,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 11:39:13,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=224, Unknown=8, NotChecked=170, Total=462 [2020-07-21 11:39:13,233 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 22 states. [2020-07-21 11:39:17,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 c_main_~b~0.offset) 1) (= 8 (select .cse1 c_main_~a~0.offset)) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= (select (let ((.cse6 (let ((.cse7 (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base)) (.cse10 (* main_~i~0 8))) (store .cse9 (+ .cse10 c_main_~a~0.offset) (+ (select .cse9 (+ .cse10 c_main_~a~0.offset (- 8))) 4)))) (.cse8 (* v_subst_2 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse5 c_main_~b~0.offset) (select .cse6 c_main_~a~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset) 1) (< v_main_~i~0_42 2))) (= 1 (select (let ((.cse11 (* c_main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse11) (+ (select .cse0 (+ c_main_~b~0.offset .cse11 (- 8))) (select .cse1 (+ .cse11 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:19,367 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (* 8 main_~i~0)) (= 8 (select .cse0 c_main_~a~0.offset))) (let ((.cse1 (* main_~i~0 8))) (= (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))) 4) (select .cse0 (+ .cse1 c_main_~a~0.offset))))))) (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse5 c_main_~b~0.offset) (select .cse6 c_main_~a~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8))) (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset)))) (not (= c_main_~a~0.base c_main_~b~0.base))) is different from false [2020-07-21 11:39:21,390 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base))) (store .cse2 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse2 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse3 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse4 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse3 .cse4 (exists ((v_prenex_6 Int)) (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (+ (select .cse5 (+ c_main_~a~0.offset (- 8))) 4) (select .cse5 c_main_~a~0.offset))) (let ((.cse6 (* v_prenex_6 8))) (= (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4) (select .cse5 (+ .cse6 c_main_~a~0.offset)))))))) (and .cse3 (= 8 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) .cse4 (exists ((main_~i~0 Int)) (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (= (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4) (select .cse7 (+ .cse8 c_main_~a~0.offset))))))))) is different from false [2020-07-21 11:39:23,482 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse4 (select .cse9 (+ c_main_~a~0.offset (- 8)))) (.cse6 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse7 (= 1 c_main_~i~0)) (.cse5 (select .cse9 c_main_~a~0.offset)) (.cse8 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and (= (+ .cse4 4) .cse5) .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse8 (= .cse4 (+ (select .cse9 (+ c_main_~a~0.offset (- 16))) 4))) (and .cse6 (exists ((v_prenex_7 Int)) (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse11 (* v_prenex_7 8))) (= (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 4) (select .cse10 (+ .cse11 c_main_~a~0.offset))))) .cse7 (= 8 .cse5) .cse8))))) is different from false [2020-07-21 11:39:25,536 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse12 (select |c_#memory_int| c_main_~a~0.base)) (.cse14 (select |c_#memory_int| c_main_~b~0.base)) (.cse13 (* c_main_~i~0 8))) (let ((.cse10 (select .cse14 (+ c_main_~b~0.offset .cse13 (- 8)))) (.cse9 (select .cse14 (+ c_main_~b~0.offset .cse13))) (.cse3 (select .cse12 (+ .cse13 c_main_~a~0.offset (- 8))))) (let ((.cse2 (= .cse9 (+ .cse3 1))) (.cse6 (= 1 c_main_~i~0)) (.cse7 (= 1 .cse10)) (.cse8 (not (= c_main_~a~0.base c_main_~b~0.base))) (.cse11 (select .cse12 (+ c_main_~a~0.offset (- 8))))) (or (and .cse2 (= 8 .cse3) (exists ((v_prenex_7 Int)) (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base)) (.cse5 (* v_prenex_7 8))) (= (+ (select .cse4 (+ .cse5 c_main_~a~0.offset (- 8))) 4) (select .cse4 (+ .cse5 c_main_~a~0.offset))))) .cse6 .cse7 .cse8) (and (= .cse9 (+ .cse10 .cse11 4)) (= (+ .cse11 4) .cse3) (= .cse9 (+ .cse11 5)) .cse6 .cse8) (and .cse2 .cse6 .cse7 .cse8 (= .cse11 (+ (select .cse12 (+ c_main_~a~0.offset (- 16))) 4)))))))) is different from false [2020-07-21 11:39:40,839 WARN L193 SmtUtils]: Spent 14.20 s on a formula simplification. DAG size of input: 123 DAG size of output: 122 [2020-07-21 11:39:45,155 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-21 11:39:51,690 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-21 11:40:04,082 WARN L193 SmtUtils]: Spent 11.43 s on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2020-07-21 11:40:17,729 WARN L193 SmtUtils]: Spent 13.12 s on a formula simplification. DAG size of input: 134 DAG size of output: 134 [2020-07-21 11:40:36,474 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-07-21 11:40:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:40:38,885 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2020-07-21 11:40:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 11:40:38,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-07-21 11:40:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:40:38,893 INFO L225 Difference]: With dead ends: 90 [2020-07-21 11:40:38,893 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 11:40:38,894 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 103.9s TimeCoverageRelationStatistics Valid=122, Invalid=454, Unknown=16, NotChecked=530, Total=1122 [2020-07-21 11:40:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 11:40:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 11:40:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 11:40:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-07-21 11:40:38,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2020-07-21 11:40:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:40:38,906 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-07-21 11:40:38,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 11:40:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-07-21 11:40:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-21 11:40:38,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:40:38,907 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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:40:39,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:40:39,109 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:40:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:40:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 4 times [2020-07-21 11:40:39,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:40:39,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703968068] [2020-07-21 11:40:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:40:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:40:39,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 11:40:39,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:40:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:40:39,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:40:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:40:39,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703968068] [2020-07-21 11:40:39,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:40:39,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-21 11:40:39,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859696317] [2020-07-21 11:40:39,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 11:40:39,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:40:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 11:40:39,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-21 11:40:39,304 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 12 states. [2020-07-21 11:40:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:40:40,093 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2020-07-21 11:40:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 11:40:40,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-21 11:40:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:40:40,097 INFO L225 Difference]: With dead ends: 113 [2020-07-21 11:40:40,097 INFO L226 Difference]: Without dead ends: 95 [2020-07-21 11:40:40,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2020-07-21 11:40:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-21 11:40:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2020-07-21 11:40:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 11:40:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 11:40:40,110 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2020-07-21 11:40:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:40:40,110 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 11:40:40,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 11:40:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 11:40:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-21 11:40:40,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:40:40,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:40:40,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:40:40,313 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:40:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:40:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-21 11:40:40,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:40:40,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1818454314] [2020-07-21 11:40:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:40:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 11:40:40,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 11:40:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 11:40:40,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 11:40:40,418 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 11:40:40,418 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 11:40:40,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:40:40,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:40:40 BoogieIcfgContainer [2020-07-21 11:40:40,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 11:40:40,706 INFO L168 Benchmark]: Toolchain (without parser) took 185655.26 ms. Allocated memory was 146.3 MB in the beginning and 262.1 MB in the end (delta: 115.9 MB). Free memory was 103.8 MB in the beginning and 178.6 MB in the end (delta: -74.8 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2020-07-21 11:40:40,712 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 11:40:40,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.99 ms. Allocated memory is still 146.3 MB. Free memory was 103.4 MB in the beginning and 93.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-21 11:40:40,713 INFO L168 Benchmark]: Boogie Preprocessor took 126.92 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-21 11:40:40,714 INFO L168 Benchmark]: RCFGBuilder took 342.76 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 164.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2020-07-21 11:40:40,714 INFO L168 Benchmark]: TraceAbstraction took 184861.80 ms. Allocated memory was 203.9 MB in the beginning and 262.1 MB in the end (delta: 58.2 MB). Free memory was 164.2 MB in the beginning and 178.6 MB in the end (delta: -14.4 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2020-07-21 11:40:40,721 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.19 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.99 ms. Allocated memory is still 146.3 MB. Free memory was 103.4 MB in the beginning and 93.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.92 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.76 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 164.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 184861.80 ms. Allocated memory was 203.9 MB in the beginning and 262.1 MB in the end (delta: 58.2 MB). Free memory was 164.2 MB in the beginning and 178.6 MB in the end (delta: -14.4 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 8 [L30] b[0] = 1 [L32] i=1 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=1, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L32] COND TRUE i