/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/eqn5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 11:45:56,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 11:45:56,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 11:45:56,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 11:45:56,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 11:45:56,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 11:45:56,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 11:45:56,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 11:45:56,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 11:45:56,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 11:45:56,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 11:45:56,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 11:45:56,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 11:45:56,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 11:45:56,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 11:45:56,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 11:45:56,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 11:45:56,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 11:45:56,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 11:45:56,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 11:45:56,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 11:45:56,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 11:45:56,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 11:45:56,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 11:45:56,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 11:45:56,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 11:45:56,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 11:45:56,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 11:45:56,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 11:45:56,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 11:45:56,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 11:45:56,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 11:45:56,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 11:45:56,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 11:45:56,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 11:45:56,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 11:45:56,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 11:45:56,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 11:45:56,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 11:45:56,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 11:45:56,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 11:45:56,731 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-20 11:45:56,747 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 11:45:56,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 11:45:56,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 11:45:56,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 11:45:56,749 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 11:45:56,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 11:45:56,749 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 11:45:56,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 11:45:56,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 11:45:56,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 11:45:56,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 11:45:56,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 11:45:56,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 11:45:56,751 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 11:45:56,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 11:45:56,751 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 11:45:56,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 11:45:56,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 11:45:56,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 11:45:56,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 11:45:56,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 11:45:56,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 11:45:56,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 11:45:56,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 11:45:56,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 11:45:56,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 11:45:56,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:56,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 11:45:56,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 11:45:56,755 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-20 11:45:57,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 11:45:57,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 11:45:57,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 11:45:57,081 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 11:45:57,082 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 11:45:57,082 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-20 11:45:57,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5e2c3e/7e20a17ec6d7426f92bdc82bdb168eca/FLAGb50e7876b [2020-07-20 11:45:57,643 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 11:45:57,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-20 11:45:57,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5e2c3e/7e20a17ec6d7426f92bdc82bdb168eca/FLAGb50e7876b [2020-07-20 11:45:58,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5e2c3e/7e20a17ec6d7426f92bdc82bdb168eca [2020-07-20 11:45:58,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 11:45:58,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 11:45:58,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 11:45:58,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 11:45:58,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 11:45:58,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ebe572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58, skipping insertion in model container [2020-07-20 11:45:58,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 11:45:58,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 11:45:58,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 11:45:58,377 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 11:45:58,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 11:45:58,442 INFO L208 MainTranslator]: Completed translation [2020-07-20 11:45:58,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58 WrapperNode [2020-07-20 11:45:58,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 11:45:58,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 11:45:58,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 11:45:58,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 11:45:58,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (1/1) ... [2020-07-20 11:45:58,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 11:45:58,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 11:45:58,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 11:45:58,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 11:45:58,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (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-20 11:45:58,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 11:45:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 11:45:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-20 11:45:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 11:45:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 11:45:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 11:45:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 11:45:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-20 11:45:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 11:45:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 11:45:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 11:45:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 11:45:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 11:45:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 11:45:58,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 11:45:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 11:45:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 11:45:58,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 11:45:58,927 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 11:45:58,927 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-20 11:45:58,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:45:58 BoogieIcfgContainer [2020-07-20 11:45:58,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 11:45:58,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 11:45:58,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 11:45:58,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 11:45:58,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 11:45:58" (1/3) ... [2020-07-20 11:45:58,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bde8ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:45:58, skipping insertion in model container [2020-07-20 11:45:58,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 11:45:58" (2/3) ... [2020-07-20 11:45:58,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bde8ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 11:45:58, skipping insertion in model container [2020-07-20 11:45:58,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 11:45:58" (3/3) ... [2020-07-20 11:45:58,942 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5f.c [2020-07-20 11:45:58,953 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 11:45:58,962 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 11:45:58,983 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 11:45:59,016 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 11:45:59,017 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 11:45:59,017 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 11:45:59,017 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 11:45:59,018 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 11:45:59,018 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 11:45:59,018 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 11:45:59,018 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 11:45:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-20 11:45:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 11:45:59,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:45:59,049 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-20 11:45:59,050 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:45:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:45:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-20 11:45:59,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:45:59,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731318335] [2020-07-20 11:45:59,074 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-20 11:45:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:45:59,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 11:45:59,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:45:59,237 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-20 11:45:59,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:45:59,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731318335] [2020-07-20 11:45:59,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:45:59,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 11:45:59,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764519685] [2020-07-20 11:45:59,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 11:45:59,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:45:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 11:45:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 11:45:59,267 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-20 11:45:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:45:59,293 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-20 11:45:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 11:45:59,295 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-20 11:45:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:45:59,304 INFO L225 Difference]: With dead ends: 58 [2020-07-20 11:45:59,304 INFO L226 Difference]: Without dead ends: 29 [2020-07-20 11:45:59,308 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-20 11:45:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-20 11:45:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-20 11:45:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-20 11:45:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-20 11:45:59,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-20 11:45:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:45:59,352 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-20 11:45:59,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 11:45:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-20 11:45:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 11:45:59,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:45:59,354 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-20 11:45:59,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:45:59,569 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:45:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:45:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-20 11:45:59,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:45:59,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [987148232] [2020-07-20 11:45:59,572 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-20 11:45:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:45:59,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 11:45:59,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:45:59,743 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-07-20 11:45:59,744 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 11:45:59,745 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:45:59,753 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:45:59,756 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 1 xjuncts. [2020-07-20 11:45:59,757 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:15 [2020-07-20 11:45:59,810 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:45:59,811 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-20 11:45:59,813 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 11:45:59,828 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-20 11:45:59,829 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-20 11:45:59,830 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-20 11:45:59,865 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-20 11:45:59,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:45:59,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [987148232] [2020-07-20 11:45:59,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:45:59,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 11:45:59,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159760661] [2020-07-20 11:45:59,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 11:45:59,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:45:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 11:45:59,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-20 11:45:59,869 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-20 11:46:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:00,007 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-20 11:46:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 11:46:00,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-20 11:46:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:00,012 INFO L225 Difference]: With dead ends: 47 [2020-07-20 11:46:00,012 INFO L226 Difference]: Without dead ends: 45 [2020-07-20 11:46:00,014 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-20 11:46:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-20 11:46:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-20 11:46:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 11:46:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-20 11:46:00,029 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-20 11:46:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:00,030 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-20 11:46:00,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 11:46:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-20 11:46:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 11:46:00,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:00,032 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-20 11:46:00,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:00,247 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:00,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-20 11:46:00,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:00,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088819300] [2020-07-20 11:46:00,250 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-20 11:46:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:00,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 11:46:00,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:00,337 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-20 11:46:00,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:46:00,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088819300] [2020-07-20 11:46:00,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:46:00,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 11:46:00,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369982375] [2020-07-20 11:46:00,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 11:46:00,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 11:46:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 11:46:00,340 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-20 11:46:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:00,494 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-20 11:46:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 11:46:00,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-20 11:46:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:00,500 INFO L225 Difference]: With dead ends: 71 [2020-07-20 11:46:00,500 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 11:46:00,502 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-20 11:46:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 11:46:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-20 11:46:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 11:46:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-20 11:46:00,519 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-20 11:46:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:00,519 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-20 11:46:00,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 11:46:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-20 11:46:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 11:46:00,522 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:00,523 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-20 11:46:00,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:00,737 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:00,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-20 11:46:00,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:00,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491359418] [2020-07-20 11:46:00,739 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-20 11:46:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:00,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 11:46:00,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:00,818 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-20 11:46:00,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:46:00,867 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-20 11:46:00,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491359418] [2020-07-20 11:46:00,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:46:00,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-20 11:46:00,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448156764] [2020-07-20 11:46:00,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 11:46:00,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 11:46:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 11:46:00,870 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-20 11:46:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:01,041 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-20 11:46:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 11:46:01,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-20 11:46:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:01,043 INFO L225 Difference]: With dead ends: 66 [2020-07-20 11:46:01,043 INFO L226 Difference]: Without dead ends: 55 [2020-07-20 11:46:01,046 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-20 11:46:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-20 11:46:01,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-20 11:46:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-20 11:46:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-20 11:46:01,072 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-20 11:46:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:01,072 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-20 11:46:01,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 11:46:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-20 11:46:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 11:46:01,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:01,074 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-20 11:46:01,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:01,275 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:01,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-20 11:46:01,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:01,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [40854781] [2020-07-20 11:46:01,277 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-20 11:46:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:01,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 11:46:01,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:01,350 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-20 11:46:01,351 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:01,358 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:01,364 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 11:46:01,364 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:01,371 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:01,371 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-20 11:46:01,371 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-20 11:46:01,437 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-20 11:46:01,438 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-20 11:46:01,440 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:01,474 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-20 11:46:01,476 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:01,480 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-20 11:46:01,480 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-20 11:46:01,481 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:01,500 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:01,523 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:01,544 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:01,602 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-20 11:46:01,602 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:01,617 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_2], 20=[|v_#memory_int_16|]} [2020-07-20 11:46:01,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:01,628 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-20 11:46:01,629 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-20 11:46:01,631 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:01,670 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:01,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:01,698 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-20 11:46:01,698 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-20 11:46:01,701 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:01,779 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-20 11:46:01,784 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-20 11:46:01,784 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-20 11:46:02,912 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-20 11:46:06,116 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-20 11:46:06,120 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:06,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:06,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:06,160 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:06,165 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:06,170 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-20 11:46:06,171 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 17 [2020-07-20 11:46:06,172 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:06,242 INFO L350 Elim1Store]: treesize reduction 27, result has 65.8 percent of original size [2020-07-20 11:46:06,246 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 73 [2020-07-20 11:46:06,249 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:46:06,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:06,256 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:06,299 INFO L624 ElimStorePlain]: treesize reduction 38, result has 37.7 percent of original size [2020-07-20 11:46:06,300 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-20 11:46:06,300 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-20 11:46:06,379 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-20 11:46:06,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:46:06,423 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:46:08,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (= 1 (select (select (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ .cse1 c_main_~a~0.offset) (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))) 10)))) c_main_~b~0.base) c_main_~b~0.offset))) is different from false [2020-07-20 11:46:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-07-20 11:46:08,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [40854781] [2020-07-20 11:46:08,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:46:08,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-20 11:46:08,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480471041] [2020-07-20 11:46:08,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 11:46:08,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:08,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 11:46:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=148, Unknown=2, NotChecked=24, Total=210 [2020-07-20 11:46:08,056 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2020-07-20 11:46:16,005 WARN L193 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-20 11:46:35,197 WARN L193 SmtUtils]: Spent 17.04 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-07-20 11:46:42,126 WARN L193 SmtUtils]: Spent 4.58 s on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-20 11:46:46,709 WARN L193 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-20 11:46:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:50,726 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2020-07-20 11:46:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-20 11:46:50,728 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-20 11:46:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:50,731 INFO L225 Difference]: With dead ends: 97 [2020-07-20 11:46:50,731 INFO L226 Difference]: Without dead ends: 95 [2020-07-20 11:46:50,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=4, NotChecked=52, Total=812 [2020-07-20 11:46:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-20 11:46:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2020-07-20 11:46:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-20 11:46:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-20 11:46:50,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 26 [2020-07-20 11:46:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:50,747 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-20 11:46:50,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 11:46:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-20 11:46:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 11:46:50,748 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:50,748 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-20 11:46:50,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:50,951 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-20 11:46:50,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:50,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457021669] [2020-07-20 11:46:50,953 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-20 11:46:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:50,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 11:46:50,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:51,031 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-20 11:46:51,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 11:46:51,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457021669] [2020-07-20 11:46:51,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 11:46:51,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 11:46:51,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199938507] [2020-07-20 11:46:51,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 11:46:51,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:51,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 11:46:51,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 11:46:51,035 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 6 states. [2020-07-20 11:46:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:51,214 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2020-07-20 11:46:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 11:46:51,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-20 11:46:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:51,216 INFO L225 Difference]: With dead ends: 78 [2020-07-20 11:46:51,216 INFO L226 Difference]: Without dead ends: 56 [2020-07-20 11:46:51,216 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-20 11:46:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-20 11:46:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2020-07-20 11:46:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-20 11:46:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2020-07-20 11:46:51,226 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 30 [2020-07-20 11:46:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:51,226 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2020-07-20 11:46:51,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 11:46:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2020-07-20 11:46:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 11:46:51,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:51,228 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-20 11:46:51,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:51,441 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:51,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2074868861, now seen corresponding path program 2 times [2020-07-20 11:46:51,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:51,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1829495174] [2020-07-20 11:46:51,443 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-20 11:46:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:51,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 11:46:51,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:51,519 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-20 11:46:51,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:46:51,560 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-20 11:46:51,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1829495174] [2020-07-20 11:46:51,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:46:51,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 11:46:51,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725200096] [2020-07-20 11:46:51,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 11:46:51,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:46:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 11:46:51,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-20 11:46:51,562 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2020-07-20 11:46:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:46:51,894 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2020-07-20 11:46:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 11:46:51,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-20 11:46:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:46:51,896 INFO L225 Difference]: With dead ends: 96 [2020-07-20 11:46:51,896 INFO L226 Difference]: Without dead ends: 74 [2020-07-20 11:46:51,896 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-20 11:46:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-20 11:46:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-07-20 11:46:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-20 11:46:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2020-07-20 11:46:51,906 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2020-07-20 11:46:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:46:51,907 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2020-07-20 11:46:51,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 11:46:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2020-07-20 11:46:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 11:46:51,908 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:46:51,908 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-20 11:46:52,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:46:52,122 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:46:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:46:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-20 11:46:52,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:46:52,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [480199850] [2020-07-20 11:46:52,124 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-20 11:46:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:46:52,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-20 11:46:52,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:46:52,192 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-20 11:46:52,193 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:52,198 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:52,205 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 11:46:52,205 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:52,211 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:52,212 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-20 11:46:52,212 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-20 11:46:52,301 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-20 11:46:52,302 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-20 11:46:52,304 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:52,367 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-20 11:46:52,368 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:52,369 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-20 11:46:52,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-20 11:46:52,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:52,407 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:52,464 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:52,465 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:52,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:52,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:52,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:52,605 INFO L244 Elim1Store]: Index analysis took 117 ms [2020-07-20 11:46:52,668 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:52,669 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-20 11:46:52,671 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 11:46:52,671 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:46:52,673 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:46:52,674 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:46:52,675 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:46:52,675 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:52,676 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:52,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:52,961 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-20 11:46:52,962 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-20 11:46:52,962 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-20 11:46:52,965 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 11:46:52,965 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 11:46:52,966 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 11:46:52,966 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 11:46:52,967 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 11:46:52,968 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:46:52,968 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:46:52,968 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:46:52,969 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:46:52,969 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:52,972 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:53,352 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2020-07-20 11:46:53,353 INFO L624 ElimStorePlain]: treesize reduction 801, result has 14.5 percent of original size [2020-07-20 11:46:53,354 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:53,355 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-20 11:46:53,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-20 11:46:53,356 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:53,549 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-20 11:46:53,552 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:53,658 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:53,803 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:46:54,053 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-20 11:46:54,055 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:46:54,085 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,086 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:54,092 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,114 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,150 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-20 11:46:54,150 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-20 11:46:54,152 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:54,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:54,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:54,187 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:54,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:54,248 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,302 INFO L244 Elim1Store]: Index analysis took 125 ms [2020-07-20 11:46:54,307 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-20 11:46:54,308 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:54,332 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:54,334 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:46:54,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:54,343 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-20 11:46:54,345 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:54,689 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-07-20 11:46:54,689 INFO L624 ElimStorePlain]: treesize reduction 53, result has 80.9 percent of original size [2020-07-20 11:46:54,690 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-20 11:46:54,691 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:225 [2020-07-20 11:46:55,013 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-07-20 11:46:55,015 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-20 11:46:55,016 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:46:55,254 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-07-20 11:46:55,257 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:46:55,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,485 INFO L244 Elim1Store]: Index analysis took 193 ms [2020-07-20 11:46:55,593 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-20 11:46:55,594 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-20 11:46:55,594 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 81 treesize of output 173 [2020-07-20 11:46:55,597 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:55,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,901 INFO L244 Elim1Store]: Index analysis took 276 ms [2020-07-20 11:46:55,915 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:55,916 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 85 treesize of output 100 [2020-07-20 11:46:55,917 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:55,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:46:55,981 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 11:46:55,982 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 87 treesize of output 109 [2020-07-20 11:46:55,984 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 11:46:56,303 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2020-07-20 11:46:56,304 INFO L624 ElimStorePlain]: treesize reduction 198, result has 54.9 percent of original size [2020-07-20 11:46:56,315 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-20 11:46:56,315 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:275, output treesize:241 [2020-07-20 11:47:17,252 WARN L193 SmtUtils]: Spent 12.93 s on a formula simplification that was a NOOP. DAG size: 100 [2020-07-20 11:47:34,825 WARN L193 SmtUtils]: Spent 16.39 s on a formula simplification that was a NOOP. DAG size: 103 [2020-07-20 11:47:34,828 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:34,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:34,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:34,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:34,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:34,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:34,903 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:34,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:34,915 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:34,993 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-20 11:47:34,994 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 82 treesize of output 65 [2020-07-20 11:47:34,995 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:34,995 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:34,998 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-20 11:47:35,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,022 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:35,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,037 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:35,154 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-20 11:47:35,155 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-20 11:47:35,155 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-20 11:47:35,157 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,158 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,158 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,159 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,160 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,160 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,161 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,163 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,163 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,167 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,168 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,171 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,171 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,174 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,175 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,175 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,176 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,177 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,177 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,179 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,180 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,181 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,181 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,182 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,186 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,186 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,189 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-20 11:47:35,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,229 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 11:47:35,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 11:47:35,418 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-20 11:47:35,419 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-20 11:47:35,420 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-20 11:47:35,422 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 11:47:35,422 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:47:35,423 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,423 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,424 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,426 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,426 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,427 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,427 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,428 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,428 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,429 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,430 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,430 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,431 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,432 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,434 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,435 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,436 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,437 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,439 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,441 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,442 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,444 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,444 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,445 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,446 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,448 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,449 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,449 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,450 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,450 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,451 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,451 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,452 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,452 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,453 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,454 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,454 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,456 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,456 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,457 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,457 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,459 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,459 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,462 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 11:47:35,462 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 11:47:35,463 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,463 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,464 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,464 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,466 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,467 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,467 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,467 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,468 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,468 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,469 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,470 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,471 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,471 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,472 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,472 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,473 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,474 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,474 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,475 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,475 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,476 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,476 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,477 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,478 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,479 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,479 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,480 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,480 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,482 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,483 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,483 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,484 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,485 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,486 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,486 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,488 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,489 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,490 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,490 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,491 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,501 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,502 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 11:47:35,504 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,511 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 11:47:35,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 11:47:35,512 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 11:47:35,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 11:47:35,517 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-20 11:47:35,948 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 74 [2020-07-20 11:47:35,950 INFO L624 ElimStorePlain]: treesize reduction 96, result has 60.2 percent of original size [2020-07-20 11:47:35,972 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-20 11:47:35,973 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:283, output treesize:7 [2020-07-20 11:47:36,174 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-20 11:47:36,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:47:36,373 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 11:47:40,842 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-20 11:47:42,862 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-20 11:47:44,891 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-20 11:47:46,944 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))) 10))))) (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 .cse4 c_main_~a~0.offset) (select .cse3 c_main_~b~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-20 11:47:48,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= 1 (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))) 10)))) (.cse6 (* v_subst_2 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 10))))) (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)) (< v_main_~i~0_42 2))) is different from false [2020-07-20 11:47:49,098 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-20 11:47:49,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [480199850] [2020-07-20 11:47:49,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:47:49,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-20 11:47:49,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184689141] [2020-07-20 11:47:49,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 11:47:49,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:47:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 11:47:49,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=224, Unknown=8, NotChecked=170, Total=462 [2020-07-20 11:47:49,101 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 22 states. [2020-07-20 11:47:53,171 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) (= 1 (select .cse1 c_main_~a~0.offset)) (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= 1 (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))) 10)))) (.cse8 (* v_subst_2 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 10))))) (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)) (< v_main_~i~0_42 2))) (not (= c_main_~a~0.base c_main_~b~0.base)) (= 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-20 11:47:55,240 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 (= 1 (select .cse0 c_main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (let ((.cse1 (* main_~i~0 8))) (= (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))) 10) (select .cse0 (+ .cse1 c_main_~a~0.offset))))))) (not (= c_main_~a~0.base c_main_~b~0.base)) (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))) 10))))) (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 .cse6 c_main_~a~0.offset) (select .cse5 c_main_~b~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))))) is different from false [2020-07-20 11:47:57,265 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse1 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse0 (= 1 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) .cse1 (exists ((main_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (* main_~i~0 8))) (= (+ (select .cse2 (+ .cse3 c_main_~a~0.offset (- 8))) 10) (select .cse2 (+ .cse3 c_main_~a~0.offset)))))) (and .cse0 (exists ((v_prenex_6 Int)) (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select .cse4 c_main_~a~0.offset) (+ (select .cse4 (+ c_main_~a~0.offset (- 8))) 10))) (let ((.cse5 (* v_prenex_6 8))) (= (+ (select .cse4 (+ .cse5 c_main_~a~0.offset (- 8))) 10) (select .cse4 (+ .cse5 c_main_~a~0.offset))))))) .cse1))) (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse6 (let ((.cse8 (select |c_#memory_int| c_main_~b~0.base))) (store .cse8 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse8 c_main_~b~0.offset))))) (.cse7 (* v_main_~i~0_42 8))) (store .cse6 (+ c_main_~b~0.offset .cse7) (+ (select .cse6 (+ c_main_~b~0.offset .cse7 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse6) c_main_~a~0.base) (+ c_main_~a~0.offset .cse7 (- 8)))))) c_main_~b~0.offset))))) is different from false [2020-07-20 11:47:59,375 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 ((.cse6 (select .cse9 (+ c_main_~a~0.offset (- 8)))) (.cse4 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse7 (select .cse9 c_main_~a~0.offset)) (.cse5 (= 1 c_main_~i~0)) (.cse8 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse4 .cse5 (= (+ .cse6 10) .cse7) .cse8) (and .cse4 .cse5 (= .cse6 (+ (select .cse9 (+ c_main_~a~0.offset (- 16))) 10)) .cse8) (and .cse4 (= 1 .cse7) .cse5 (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)) (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 10)))) .cse8))))) is different from false [2020-07-20 11:48:01,436 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 ((.cse6 (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 ((.cse12 (select .cse14 (+ c_main_~b~0.offset .cse13 (- 8)))) (.cse9 (select .cse14 (+ c_main_~b~0.offset .cse13))) (.cse8 (select .cse6 (+ .cse13 c_main_~a~0.offset (- 8))))) (let ((.cse2 (= .cse9 (+ .cse8 1))) (.cse3 (= .cse9 (+ .cse12 .cse8))) (.cse5 (select .cse6 (+ c_main_~a~0.offset (- 8)))) (.cse4 (= 1 c_main_~i~0)) (.cse7 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse2 .cse3 .cse4 (= .cse5 (+ (select .cse6 (+ c_main_~a~0.offset (- 16))) 10)) .cse7) (and .cse2 .cse3 .cse4 (= (+ .cse5 10) .cse8) .cse7) (and (= .cse9 2) .cse4 (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)) (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 10)))) (= 1 .cse8) (= 1 .cse12) .cse7)))))) is different from false [2020-07-20 11:48:15,541 WARN L193 SmtUtils]: Spent 11.01 s on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-07-20 11:48:16,471 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-20 11:48:21,513 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-20 11:48:36,061 WARN L193 SmtUtils]: Spent 12.69 s on a formula simplification. DAG size of input: 133 DAG size of output: 133 [2020-07-20 11:48:48,998 WARN L193 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 135 DAG size of output: 135 [2020-07-20 11:48:54,244 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-07-20 11:49:08,643 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-07-20 11:49:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:49:12,859 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-07-20 11:49:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 11:49:12,873 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-07-20 11:49:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:49:12,874 INFO L225 Difference]: With dead ends: 74 [2020-07-20 11:49:12,875 INFO L226 Difference]: Without dead ends: 72 [2020-07-20 11:49:12,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 115.2s TimeCoverageRelationStatistics Valid=130, Invalid=490, Unknown=20, NotChecked=550, Total=1190 [2020-07-20 11:49:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-20 11:49:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-07-20 11:49:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-20 11:49:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2020-07-20 11:49:12,889 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2020-07-20 11:49:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:49:12,889 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2020-07-20 11:49:12,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 11:49:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2020-07-20 11:49:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 11:49:12,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:49:12,891 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-20 11:49:13,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:49:13,106 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:49:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:49:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1619571715, now seen corresponding path program 4 times [2020-07-20 11:49:13,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:49:13,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314424177] [2020-07-20 11:49:13,108 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-20 11:49:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 11:49:13,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 11:49:13,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 11:49:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:49:13,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 11:49:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 11:49:13,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314424177] [2020-07-20 11:49:13,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 11:49:13,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-07-20 11:49:13,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48110157] [2020-07-20 11:49:13,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 11:49:13,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 11:49:13,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 11:49:13,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-20 11:49:13,309 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2020-07-20 11:49:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 11:49:15,225 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2020-07-20 11:49:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-20 11:49:15,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-07-20 11:49:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 11:49:15,228 INFO L225 Difference]: With dead ends: 132 [2020-07-20 11:49:15,228 INFO L226 Difference]: Without dead ends: 114 [2020-07-20 11:49:15,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2020-07-20 11:49:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-20 11:49:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 56. [2020-07-20 11:49:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 11:49:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-20 11:49:15,246 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 30 [2020-07-20 11:49:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 11:49:15,247 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-20 11:49:15,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 11:49:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-20 11:49:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-20 11:49:15,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 11:49:15,248 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-20 11:49:15,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:49:15,450 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 11:49:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 11:49:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-20 11:49:15,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 11:49:15,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597213806] [2020-07-20 11:49:15,452 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-20 11:49:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 11:49:15,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 11:49:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 11:49:15,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 11:49:15,572 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 11:49:15,572 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 11:49:15,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 11:49:15,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 11:49:15 BoogieIcfgContainer [2020-07-20 11:49:15,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 11:49:15,842 INFO L168 Benchmark]: Toolchain (without parser) took 197817.42 ms. Allocated memory was 144.7 MB in the beginning and 270.5 MB in the end (delta: 125.8 MB). Free memory was 100.6 MB in the beginning and 95.0 MB in the end (delta: 5.6 MB). Peak memory consumption was 131.4 MB. Max. memory is 7.1 GB. [2020-07-20 11:49:15,843 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-20 11:49:15,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.45 ms. Allocated memory is still 144.7 MB. Free memory was 100.1 MB in the beginning and 89.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-20 11:49:15,844 INFO L168 Benchmark]: Boogie Preprocessor took 161.34 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 89.9 MB in the beginning and 180.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-20 11:49:15,845 INFO L168 Benchmark]: RCFGBuilder took 325.76 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 163.4 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2020-07-20 11:49:15,845 INFO L168 Benchmark]: TraceAbstraction took 196907.53 ms. Allocated memory was 202.9 MB in the beginning and 270.5 MB in the end (delta: 67.6 MB). Free memory was 162.7 MB in the beginning and 95.0 MB in the end (delta: 67.8 MB). Peak memory consumption was 135.4 MB. Max. memory is 7.1 GB. [2020-07-20 11:49:15,848 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.14 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 415.45 ms. Allocated memory is still 144.7 MB. Free memory was 100.1 MB in the beginning and 89.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.34 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 89.9 MB in the beginning and 180.3 MB in the end (delta: -90.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.76 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 163.4 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196907.53 ms. Allocated memory was 202.9 MB in the beginning and 270.5 MB in the end (delta: 67.6 MB). Free memory was 162.7 MB in the beginning and 95.0 MB in the end (delta: 67.8 MB). Peak memory consumption was 135.4 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] = 1 [L30] b[0] = 1 [L31] i=1 VAL [\old(N)=0, a={-2:0}, b={-1:0}, i=1, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L31] COND TRUE i