/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 SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 23:08:43,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 23:08:43,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 23:08:43,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 23:08:43,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 23:08:43,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 23:08:43,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 23:08:43,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 23:08:43,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 23:08:43,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 23:08:43,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 23:08:43,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 23:08:43,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 23:08:43,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 23:08:43,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 23:08:43,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 23:08:43,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 23:08:43,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 23:08:43,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 23:08:43,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 23:08:43,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 23:08:43,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 23:08:43,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 23:08:43,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 23:08:43,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 23:08:43,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 23:08:43,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 23:08:43,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 23:08:43,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 23:08:43,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 23:08:43,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 23:08:43,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 23:08:43,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 23:08:43,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 23:08:43,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 23:08:43,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 23:08:43,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 23:08:43,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 23:08:43,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 23:08:43,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 23:08:43,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 23:08:43,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 23:08:43,584 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 23:08:43,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 23:08:43,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 23:08:43,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 23:08:43,592 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 23:08:43,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 23:08:43,592 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 23:08:43,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 23:08:43,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 23:08:43,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 23:08:43,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 23:08:43,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 23:08:43,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 23:08:43,593 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 23:08:43,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 23:08:43,594 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 23:08:43,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 23:08:43,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 23:08:43,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 23:08:43,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 23:08:43,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 23:08:43,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 23:08:43,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 23:08:43,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 23:08:43,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 23:08:43,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 23:08:43,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:43,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 23:08:43,596 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 23:08:43,597 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 -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 23:08:43,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 23:08:43,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 23:08:43,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 23:08:43,896 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 23:08:43,896 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 23:08:43,897 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-21 23:08:43,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f99f1b2/1889e14e4c7c4a54a3e10eb7c5b95958/FLAG106f822db [2020-07-21 23:08:44,421 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 23:08:44,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-21 23:08:44,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f99f1b2/1889e14e4c7c4a54a3e10eb7c5b95958/FLAG106f822db [2020-07-21 23:08:44,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f99f1b2/1889e14e4c7c4a54a3e10eb7c5b95958 [2020-07-21 23:08:44,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 23:08:44,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 23:08:44,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 23:08:44,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 23:08:44,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 23:08:44,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:08:44" (1/1) ... [2020-07-21 23:08:44,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dffb5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:44, skipping insertion in model container [2020-07-21 23:08:44,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:08:44" (1/1) ... [2020-07-21 23:08:44,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 23:08:44,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 23:08:45,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:08:45,068 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 23:08:45,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:08:45,104 INFO L208 MainTranslator]: Completed translation [2020-07-21 23:08:45,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45 WrapperNode [2020-07-21 23:08:45,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 23:08:45,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 23:08:45,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 23:08:45,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 23:08:45,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... [2020-07-21 23:08:45,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... [2020-07-21 23:08:45,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... [2020-07-21 23:08:45,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... [2020-07-21 23:08:45,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... [2020-07-21 23:08:45,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... [2020-07-21 23:08:45,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... [2020-07-21 23:08:45,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 23:08:45,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 23:08:45,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 23:08:45,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 23:08:45,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 23:08:45,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 23:08:45,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 23:08:45,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 23:08:45,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 23:08:45,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 23:08:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 23:08:45,313 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 23:08:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 23:08:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 23:08:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 23:08:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-21 23:08:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 23:08:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-21 23:08:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-21 23:08:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-21 23:08:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 23:08:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 23:08:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 23:08:45,608 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 23:08:45,608 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-21 23:08:45,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:08:45 BoogieIcfgContainer [2020-07-21 23:08:45,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 23:08:45,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 23:08:45,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 23:08:45,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 23:08:45,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:08:44" (1/3) ... [2020-07-21 23:08:45,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cce569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:08:45, skipping insertion in model container [2020-07-21 23:08:45,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:08:45" (2/3) ... [2020-07-21 23:08:45,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cce569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:08:45, skipping insertion in model container [2020-07-21 23:08:45,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:08:45" (3/3) ... [2020-07-21 23:08:45,623 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-21 23:08:45,632 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 23:08:45,638 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 23:08:45,651 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 23:08:45,672 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 23:08:45,673 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 23:08:45,673 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 23:08:45,673 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 23:08:45,673 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 23:08:45,673 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 23:08:45,673 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 23:08:45,674 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 23:08:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-21 23:08:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 23:08:45,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:08:45,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:08:45,695 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:08:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:08:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-21 23:08:45,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:08:45,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1697728308] [2020-07-21 23:08:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:45,844 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:08:45,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:08:45,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 23:08:45,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:08:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:08:45,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:08:45,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1697728308] [2020-07-21 23:08:45,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:08:45,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 23:08:45,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285059220] [2020-07-21 23:08:45,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 23:08:45,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:08:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 23:08:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 23:08:45,895 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-21 23:08:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:08:45,917 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-21 23:08:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 23:08:45,918 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-21 23:08:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:08:45,926 INFO L225 Difference]: With dead ends: 58 [2020-07-21 23:08:45,926 INFO L226 Difference]: Without dead ends: 29 [2020-07-21 23:08:45,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 23:08:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-21 23:08:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-21 23:08:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-21 23:08:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-21 23:08:45,969 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-21 23:08:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:08:45,970 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-21 23:08:45,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 23:08:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-21 23:08:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 23:08:45,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:08:45,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:08:46,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:46,187 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:08:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:08:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-21 23:08:46,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:08:46,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [897454742] [2020-07-21 23:08:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:46,263 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:08:46,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:08:46,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:08:46,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:08:46,358 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:08:46,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-21 23:08:46,361 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:08:46,392 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-21 23:08:46,395 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 23:08:46,396 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-21 23:08:46,439 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:08:46,440 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-21 23:08:46,441 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 23:08:46,453 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-21 23:08:46,454 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 23:08:46,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-21 23:08:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:08:46,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:08:46,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [897454742] [2020-07-21 23:08:46,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:08:46,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-21 23:08:46,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828616409] [2020-07-21 23:08:46,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 23:08:46,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:08:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 23:08:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-21 23:08:46,495 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-21 23:08:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:08:46,625 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-21 23:08:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 23:08:46,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-21 23:08:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:08:46,629 INFO L225 Difference]: With dead ends: 47 [2020-07-21 23:08:46,630 INFO L226 Difference]: Without dead ends: 45 [2020-07-21 23:08:46,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-21 23:08:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-21 23:08:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-21 23:08:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 23:08:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-21 23:08:46,646 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-21 23:08:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:08:46,647 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-21 23:08:46,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 23:08:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-21 23:08:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 23:08:46,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:08:46,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:08:46,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:46,864 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:08:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:08:46,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-21 23:08:46,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:08:46,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743194436] [2020-07-21 23:08:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:46,941 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:08:46,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:08:46,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 23:08:46,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:08:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:08:46,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:08:46,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743194436] [2020-07-21 23:08:46,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:08:46,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 23:08:46,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324840591] [2020-07-21 23:08:46,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 23:08:46,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:08:46,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 23:08:46,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 23:08:46,973 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-21 23:08:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:08:47,060 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-21 23:08:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 23:08:47,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-21 23:08:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:08:47,064 INFO L225 Difference]: With dead ends: 71 [2020-07-21 23:08:47,065 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 23:08:47,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-21 23:08:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 23:08:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-21 23:08:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 23:08:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-21 23:08:47,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-21 23:08:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:08:47,076 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-21 23:08:47,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 23:08:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-21 23:08:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 23:08:47,077 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:08:47,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:08:47,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:47,292 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:08:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:08:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-21 23:08:47,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:08:47,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088052977] [2020-07-21 23:08:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:47,337 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:08:47,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:08:47,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 23:08:47,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:08:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:08:47,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:08:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:08:47,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088052977] [2020-07-21 23:08:47,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:08:47,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 23:08:47,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644361974] [2020-07-21 23:08:47,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:08:47,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:08:47,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:08:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:08:47,414 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-21 23:08:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:08:47,551 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-21 23:08:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 23:08:47,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-21 23:08:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:08:47,553 INFO L225 Difference]: With dead ends: 66 [2020-07-21 23:08:47,553 INFO L226 Difference]: Without dead ends: 55 [2020-07-21 23:08:47,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-21 23:08:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-21 23:08:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-21 23:08:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-21 23:08:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-21 23:08:47,563 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-21 23:08:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:08:47,564 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-21 23:08:47,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:08:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-21 23:08:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 23:08:47,565 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:08:47,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:08:47,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:47,779 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:08:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:08:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-21 23:08:47,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:08:47,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1953132324] [2020-07-21 23:08:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:08:47,840 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:08:47,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:08:47,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 23:08:47,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:08:47,864 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-21 23:08:47,865 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:08:47,871 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:08:47,877 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 23:08:47,877 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 23:08:47,884 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:08:47,884 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 23:08:47,885 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 23:08:47,942 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 23:08:47,943 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-21 23:08:47,944 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:08:47,976 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 23:08:47,978 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:47,982 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 23:08:47,983 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 23:08:47,984 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:48,008 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:48,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:48,063 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:48,125 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-21 23:08:48,126 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:48,141 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_2], 20=[|v_#memory_int_16|]} [2020-07-21 23:08:48,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:08:48,153 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-21 23:08:48,154 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-21 23:08:48,156 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:08:48,199 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:08:48,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:08:48,231 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-21 23:08:48,231 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-21 23:08:48,235 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 23:08:48,316 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-21 23:08:48,321 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-21 23:08:48,322 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-21 23:08:49,718 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-21 23:08:53,160 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-21 23:08:53,164 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:53,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:08:53,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:08:53,192 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:08:53,196 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:08:53,226 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-21 23:08:53,226 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 47 [2020-07-21 23:08:53,229 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:08:53,230 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:08:53,236 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:08:53,276 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-21 23:08:53,277 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 43 [2020-07-21 23:08:53,280 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-21 23:08:53,325 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-21 23:08:53,326 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 23:08:53,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-21 23:08:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:08:53,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:08:53,447 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:09:08,513 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 23:09:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:09:08,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1953132324] [2020-07-21 23:09:08,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:09:08,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-21 23:09:08,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186113333] [2020-07-21 23:09:08,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 23:09:08,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:09:08,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 23:09:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=162, Unknown=8, NotChecked=0, Total=210 [2020-07-21 23:09:08,546 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2020-07-21 23:09:13,967 WARN L193 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-21 23:09:38,183 WARN L193 SmtUtils]: Spent 20.47 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-07-21 23:09:40,239 WARN L838 $PredicateComparison]: unable to prove that (and (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))) 4)))) c_main_~b~0.base) c_main_~b~0.offset))) (= 1 (select (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)))))) c_main_~b~0.offset))) is different from false [2020-07-21 23:09:47,492 WARN L193 SmtUtils]: Spent 4.74 s on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-21 23:09:52,264 WARN L193 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-21 23:10:02,612 WARN L193 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2020-07-21 23:10:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:10:04,665 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2020-07-21 23:10:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-21 23:10:04,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-21 23:10:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:10:04,675 INFO L225 Difference]: With dead ends: 104 [2020-07-21 23:10:04,676 INFO L226 Difference]: Without dead ends: 102 [2020-07-21 23:10:04,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 66.3s TimeCoverageRelationStatistics Valid=165, Invalid=698, Unknown=11, NotChecked=56, Total=930 [2020-07-21 23:10:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-21 23:10:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 54. [2020-07-21 23:10:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 23:10:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-07-21 23:10:04,691 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 26 [2020-07-21 23:10:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:10:04,692 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-07-21 23:10:04,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 23:10:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-21 23:10:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 23:10:04,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:10:04,693 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:10:04,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:10:04,894 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:10:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:10:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-21 23:10:04,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:10:04,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981040032] [2020-07-21 23:10:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:10:04,944 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:10:04,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:10:04,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 23:10:04,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:10:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:10:05,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:10:05,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981040032] [2020-07-21 23:10:05,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:10:05,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 23:10:05,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634142439] [2020-07-21 23:10:05,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:10:05,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:10:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:10:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:10:05,012 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 6 states. [2020-07-21 23:10:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:10:05,263 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2020-07-21 23:10:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 23:10:05,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-21 23:10:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:10:05,265 INFO L225 Difference]: With dead ends: 80 [2020-07-21 23:10:05,265 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 23:10:05,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-21 23:10:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 23:10:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2020-07-21 23:10:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 23:10:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-21 23:10:05,277 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2020-07-21 23:10:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:10:05,277 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-21 23:10:05,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:10:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-21 23:10:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 23:10:05,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:10:05,279 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:10:05,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:10:05,480 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:10:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:10:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2074868861, now seen corresponding path program 2 times [2020-07-21 23:10:05,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:10:05,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446342623] [2020-07-21 23:10:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:10:05,521 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:10:05,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:10:05,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 23:10:05,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:10:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 23:10:05,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:10:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 23:10:05,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446342623] [2020-07-21 23:10:05,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:10:05,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-21 23:10:05,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486344455] [2020-07-21 23:10:05,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 23:10:05,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:10:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 23:10:05,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-21 23:10:05,621 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 9 states. [2020-07-21 23:10:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:10:06,035 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-21 23:10:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 23:10:06,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-21 23:10:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:10:06,038 INFO L225 Difference]: With dead ends: 98 [2020-07-21 23:10:06,038 INFO L226 Difference]: Without dead ends: 76 [2020-07-21 23:10:06,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 23:10:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-21 23:10:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-07-21 23:10:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 23:10:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-07-21 23:10:06,050 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2020-07-21 23:10:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:10:06,050 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-07-21 23:10:06,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 23:10:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-21 23:10:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 23:10:06,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:10:06,052 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:10:06,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:10:06,265 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:10:06,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:10:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-21 23:10:06,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:10:06,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642294251] [2020-07-21 23:10:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:10:06,329 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:10:06,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:10:06,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 23:10:06,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:10:06,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-21 23:10:06,360 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:06,381 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:10:06,389 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 23:10:06,390 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:06,413 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:10:06,413 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 23:10:06,413 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 23:10:06,548 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-07-21 23:10:06,549 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 23:10:06,550 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-21 23:10:06,552 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:06,662 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-07-21 23:10:06,663 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 23:10:06,664 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:06,665 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 23:10:06,665 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 23:10:06,666 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:06,732 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:06,803 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:06,804 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:06,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:06,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:07,013 INFO L244 Elim1Store]: Index analysis took 176 ms [2020-07-21 23:10:07,091 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:10:07,091 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2020-07-21 23:10:07,093 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 23:10:07,094 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 23:10:07,095 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:07,095 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:07,096 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:07,096 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:07,098 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:07,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:07,417 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-21 23:10:07,419 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-21 23:10:07,419 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2020-07-21 23:10:07,421 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-21 23:10:07,421 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 23:10:07,423 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 23:10:07,423 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 23:10:07,424 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 23:10:07,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 23:10:07,425 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:07,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:07,426 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:07,426 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:07,428 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:07,937 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2020-07-21 23:10:07,938 INFO L624 ElimStorePlain]: treesize reduction 803, result has 14.5 percent of original size [2020-07-21 23:10:07,939 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:07,941 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-21 23:10:07,941 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-21 23:10:07,942 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:08,121 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-21 23:10:08,123 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:08,268 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:08,501 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:08,854 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-21 23:10:08,857 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 23:10:08,904 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:08,905 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:08,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:08,916 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:08,957 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:09,002 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-21 23:10:09,003 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2020-07-21 23:10:09,005 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:09,046 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:09,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:09,055 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:09,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:09,077 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:09,120 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:09,161 INFO L244 Elim1Store]: Index analysis took 115 ms [2020-07-21 23:10:09,166 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2020-07-21 23:10:09,168 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:09,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:09,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:09,203 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:09,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:09,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:09,212 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2020-07-21 23:10:09,214 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:09,661 WARN L193 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-07-21 23:10:09,662 INFO L624 ElimStorePlain]: treesize reduction 71, result has 74.9 percent of original size [2020-07-21 23:10:09,663 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-07-21 23:10:09,663 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:212 [2020-07-21 23:10:10,162 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-07-21 23:10:10,164 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-21 23:10:10,164 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 23:10:10,578 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-07-21 23:10:10,581 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 23:10:10,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:10,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:10,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:10,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:10,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:10,995 INFO L244 Elim1Store]: Index analysis took 341 ms [2020-07-21 23:10:11,137 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-21 23:10:11,138 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-21 23:10:11,139 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 175 [2020-07-21 23:10:11,141 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:11,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,615 INFO L244 Elim1Store]: Index analysis took 423 ms [2020-07-21 23:10:11,644 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:10:11,645 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 101 [2020-07-21 23:10:11,646 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:11,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:11,763 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 23:10:11,764 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 107 [2020-07-21 23:10:11,766 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 23:10:12,374 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-07-21 23:10:12,375 INFO L624 ElimStorePlain]: treesize reduction 210, result has 54.4 percent of original size [2020-07-21 23:10:12,391 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-07-21 23:10:12,391 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:274, output treesize:251 [2020-07-21 23:10:36,997 WARN L193 SmtUtils]: Spent 14.21 s on a formula simplification that was a NOOP. DAG size: 101 [2020-07-21 23:10:52,364 WARN L193 SmtUtils]: Spent 14.28 s on a formula simplification that was a NOOP. DAG size: 105 [2020-07-21 23:10:52,367 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 23:10:52,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,433 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:52,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,446 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:52,551 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-21 23:10:52,552 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 67 [2020-07-21 23:10:52,553 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,554 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,560 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 23:10:52,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,592 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:52,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,609 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:52,750 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-21 23:10:52,751 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-21 23:10:52,751 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 80 [2020-07-21 23:10:52,753 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,753 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,754 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 23:10:52,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,756 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,756 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,757 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 23:10:52,758 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,759 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,763 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,771 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,772 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,776 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,776 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,777 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,781 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,781 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,784 INFO L544 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 23:10:52,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,816 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 23:10:52,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 23:10:52,943 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-21 23:10:52,944 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-21 23:10:52,944 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 111 [2020-07-21 23:10:52,946 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 23:10:52,946 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 23:10:52,947 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,947 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,948 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,948 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,949 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,950 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,951 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,951 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,952 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,953 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,953 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,958 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,960 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,960 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,961 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,961 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,963 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,964 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,965 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,966 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,966 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,969 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 23:10:52,969 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 23:10:52,970 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,970 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,972 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,972 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,973 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,973 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,976 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,977 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,977 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,977 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,978 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,979 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,980 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,980 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,980 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,981 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,982 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,983 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,983 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,983 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,984 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,985 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,985 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,986 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,986 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,987 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,987 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,989 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,990 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,990 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,991 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,991 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,992 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,992 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,993 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 23:10:52,993 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 23:10:52,994 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,994 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,995 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,995 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,996 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,997 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 23:10:52,998 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 23:10:52,999 INFO L544 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-21 23:10:53,458 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2020-07-21 23:10:53,459 INFO L624 ElimStorePlain]: treesize reduction 141, result has 48.0 percent of original size [2020-07-21 23:10:53,482 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 23:10:53,482 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:293, output treesize:7 [2020-07-21 23:10:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:10:53,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:10:54,044 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:10:58,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 23:11:00,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 23:11:02,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base))) (store .cse2 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse2 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 23:11:04,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse4 (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (* main_~i~0 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse3 c_main_~b~0.offset) (select .cse4 c_main_~a~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)))) is different from false [2020-07-21 23:11:06,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= (select (let ((.cse4 (let ((.cse5 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4)))) (.cse6 (* v_subst_2 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse3 c_main_~b~0.offset) (select .cse4 c_main_~a~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset) 1) (< v_main_~i~0_42 2))) is different from false [2020-07-21 23:11:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-07-21 23:11:06,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642294251] [2020-07-21 23:11:06,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:11:06,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-21 23:11:06,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803519941] [2020-07-21 23:11:06,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 23:11:06,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:11:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 23:11:06,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=222, Unknown=10, NotChecked=170, Total=462 [2020-07-21 23:11:06,585 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 22 states. [2020-07-21 23:11:10,673 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 c_main_~b~0.offset) 1) (= 8 (select .cse1 c_main_~a~0.offset)) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= (select (let ((.cse6 (let ((.cse7 (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base)) (.cse10 (* main_~i~0 8))) (store .cse9 (+ .cse10 c_main_~a~0.offset) (+ (select .cse9 (+ .cse10 c_main_~a~0.offset (- 8))) 4)))) (.cse8 (* v_subst_2 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse5 c_main_~b~0.offset) (select .cse6 c_main_~a~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset) 1) (< v_main_~i~0_42 2))) (= 1 (select (let ((.cse11 (* c_main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse11) (+ (select .cse0 (+ c_main_~b~0.offset .cse11 (- 8))) (select .cse1 (+ .cse11 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 23:11:12,742 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (* 8 main_~i~0)) (= 8 (select .cse0 c_main_~a~0.offset))) (let ((.cse1 (* main_~i~0 8))) (= (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))) 4) (select .cse0 (+ .cse1 c_main_~a~0.offset))))))) (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse5 c_main_~b~0.offset) (select .cse6 c_main_~a~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8))) (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset)))) (not (= c_main_~a~0.base c_main_~b~0.base))) is different from false [2020-07-21 23:11:14,773 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base))) (store .cse2 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse2 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse3 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse4 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse3 .cse4 (exists ((v_prenex_6 Int)) (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (+ (select .cse5 (+ c_main_~a~0.offset (- 8))) 4) (select .cse5 c_main_~a~0.offset))) (let ((.cse6 (* v_prenex_6 8))) (= (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 4) (select .cse5 (+ .cse6 c_main_~a~0.offset)))))))) (and .cse3 (= 8 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) .cse4 (exists ((main_~i~0 Int)) (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (= (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 4) (select .cse7 (+ .cse8 c_main_~a~0.offset))))))))) is different from false [2020-07-21 23:11:16,902 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse4 (select .cse9 (+ c_main_~a~0.offset (- 8)))) (.cse6 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse7 (= 1 c_main_~i~0)) (.cse5 (select .cse9 c_main_~a~0.offset)) (.cse8 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and (= (+ .cse4 4) .cse5) .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse8 (= .cse4 (+ (select .cse9 (+ c_main_~a~0.offset (- 16))) 4))) (and .cse6 (exists ((v_prenex_7 Int)) (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse11 (* v_prenex_7 8))) (= (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 4) (select .cse10 (+ .cse11 c_main_~a~0.offset))))) .cse7 (= 8 .cse5) .cse8))))) is different from false [2020-07-21 23:11:18,976 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse12 (select |c_#memory_int| c_main_~a~0.base)) (.cse14 (select |c_#memory_int| c_main_~b~0.base)) (.cse13 (* c_main_~i~0 8))) (let ((.cse10 (select .cse14 (+ c_main_~b~0.offset .cse13 (- 8)))) (.cse9 (select .cse14 (+ c_main_~b~0.offset .cse13))) (.cse3 (select .cse12 (+ .cse13 c_main_~a~0.offset (- 8))))) (let ((.cse2 (= .cse9 (+ .cse3 1))) (.cse6 (= 1 c_main_~i~0)) (.cse7 (= 1 .cse10)) (.cse8 (not (= c_main_~a~0.base c_main_~b~0.base))) (.cse11 (select .cse12 (+ c_main_~a~0.offset (- 8))))) (or (and .cse2 (= 8 .cse3) (exists ((v_prenex_7 Int)) (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base)) (.cse5 (* v_prenex_7 8))) (= (+ (select .cse4 (+ .cse5 c_main_~a~0.offset (- 8))) 4) (select .cse4 (+ .cse5 c_main_~a~0.offset))))) .cse6 .cse7 .cse8) (and (= .cse9 (+ .cse10 .cse11 4)) (= (+ .cse11 4) .cse3) (= .cse9 (+ .cse11 5)) .cse6 .cse8) (and .cse2 .cse6 .cse7 .cse8 (= .cse11 (+ (select .cse12 (+ c_main_~a~0.offset (- 16))) 4)))))))) is different from false [2020-07-21 23:11:31,046 WARN L193 SmtUtils]: Spent 9.95 s on a formula simplification. DAG size of input: 123 DAG size of output: 122 [2020-07-21 23:11:33,474 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-21 23:11:38,044 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-21 23:11:51,740 WARN L193 SmtUtils]: Spent 13.09 s on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2020-07-21 23:12:07,044 WARN L193 SmtUtils]: Spent 13.21 s on a formula simplification. DAG size of input: 134 DAG size of output: 134 [2020-07-21 23:12:27,105 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-07-21 23:12:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:12:35,699 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2020-07-21 23:12:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 23:12:35,711 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-07-21 23:12:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:12:35,712 INFO L225 Difference]: With dead ends: 90 [2020-07-21 23:12:35,712 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 23:12:35,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 111.1s TimeCoverageRelationStatistics Valid=122, Invalid=452, Unknown=18, NotChecked=530, Total=1122 [2020-07-21 23:12:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 23:12:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 23:12:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 23:12:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-07-21 23:12:35,725 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2020-07-21 23:12:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:12:35,733 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-07-21 23:12:35,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 23:12:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-07-21 23:12:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-21 23:12:35,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:12:35,734 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:12:35,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:12:35,936 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:12:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:12:35,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 4 times [2020-07-21 23:12:35,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:12:35,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [467758411] [2020-07-21 23:12:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:12:35,996 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:12:35,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:12:35,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:12:36,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:12:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:12:36,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:12:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 23:12:36,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [467758411] [2020-07-21 23:12:36,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 23:12:36,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-21 23:12:36,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860526321] [2020-07-21 23:12:36,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 23:12:36,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:12:36,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 23:12:36,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-21 23:12:36,139 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 12 states. [2020-07-21 23:12:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:12:36,972 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2020-07-21 23:12:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 23:12:36,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-21 23:12:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:12:36,976 INFO L225 Difference]: With dead ends: 113 [2020-07-21 23:12:36,977 INFO L226 Difference]: Without dead ends: 95 [2020-07-21 23:12:36,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2020-07-21 23:12:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-21 23:12:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2020-07-21 23:12:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 23:12:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 23:12:36,989 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2020-07-21 23:12:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:12:36,990 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 23:12:36,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 23:12:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 23:12:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-21 23:12:36,991 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:12:36,991 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 23:12:37,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:12:37,193 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:12:37,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:12:37,193 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-21 23:12:37,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:12:37,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1927466473] [2020-07-21 23:12:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:12:37,239 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:12:37,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 23:12:37,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 23:12:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 23:12:37,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 23:12:37,280 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 23:12:37,280 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 23:12:37,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:12:37,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:12:37 BoogieIcfgContainer [2020-07-21 23:12:37,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 23:12:37,534 INFO L168 Benchmark]: Toolchain (without parser) took 232717.22 ms. Allocated memory was 146.8 MB in the beginning and 260.6 MB in the end (delta: 113.8 MB). Free memory was 103.0 MB in the beginning and 139.9 MB in the end (delta: -36.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 7.1 GB. [2020-07-21 23:12:37,534 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-21 23:12:37,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.15 ms. Allocated memory is still 146.8 MB. Free memory was 102.6 MB in the beginning and 92.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-21 23:12:37,535 INFO L168 Benchmark]: Boogie Preprocessor took 135.51 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 92.3 MB in the beginning and 183.4 MB in the end (delta: -91.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-21 23:12:37,536 INFO L168 Benchmark]: RCFGBuilder took 371.89 ms. Allocated memory is still 205.0 MB. Free memory was 182.8 MB in the beginning and 165.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2020-07-21 23:12:37,536 INFO L168 Benchmark]: TraceAbstraction took 231918.46 ms. Allocated memory was 205.0 MB in the beginning and 260.6 MB in the end (delta: 55.6 MB). Free memory was 165.2 MB in the beginning and 139.9 MB in the end (delta: 25.4 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2020-07-21 23:12:37,539 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.21 ms. Allocated memory is still 146.8 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 286.15 ms. Allocated memory is still 146.8 MB. Free memory was 102.6 MB in the beginning and 92.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.51 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 92.3 MB in the beginning and 183.4 MB in the end (delta: -91.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 371.89 ms. Allocated memory is still 205.0 MB. Free memory was 182.8 MB in the beginning and 165.8 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231918.46 ms. Allocated memory was 205.0 MB in the beginning and 260.6 MB in the end (delta: 55.6 MB). Free memory was 165.2 MB in the beginning and 139.9 MB in the end (delta: 25.4 MB). Peak memory consumption was 80.9 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)=4, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 8 [L30] b[0] = 1 [L32] i=1 VAL [\old(N)=0, a={-2:0}, b={-1:0}, i=1, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L32] COND TRUE i