/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 01:38:17,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 01:38:17,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 01:38:17,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 01:38:17,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 01:38:17,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 01:38:17,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 01:38:17,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 01:38:17,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 01:38:17,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 01:38:17,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 01:38:17,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 01:38:17,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 01:38:17,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 01:38:17,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 01:38:17,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 01:38:17,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 01:38:17,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 01:38:17,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 01:38:17,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 01:38:17,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 01:38:17,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 01:38:17,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 01:38:17,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 01:38:17,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 01:38:17,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 01:38:17,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 01:38:17,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 01:38:17,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 01:38:17,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 01:38:17,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 01:38:17,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 01:38:17,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 01:38:17,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 01:38:17,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 01:38:17,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 01:38:17,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 01:38:17,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 01:38:17,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 01:38:17,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 01:38:17,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 01:38:17,651 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 01:38:17,668 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 01:38:17,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 01:38:17,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 01:38:17,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 01:38:17,670 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 01:38:17,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 01:38:17,670 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 01:38:17,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 01:38:17,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 01:38:17,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 01:38:17,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 01:38:17,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 01:38:17,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 01:38:17,672 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 01:38:17,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 01:38:17,672 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 01:38:17,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 01:38:17,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 01:38:17,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 01:38:17,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 01:38:17,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 01:38:17,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 01:38:17,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 01:38:17,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 01:38:17,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 01:38:17,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 01:38:17,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:38:17,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 01:38:17,675 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 01:38:17,675 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 01:38:17,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 01:38:17,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 01:38:17,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 01:38:17,989 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 01:38:17,989 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 01:38:17,990 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 01:38:18,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a1f4172/e03ba6a00dfc47c4a4d6a78fd919f6fc/FLAG57cb4c68f [2020-07-21 01:38:18,511 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 01:38:18,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-21 01:38:18,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a1f4172/e03ba6a00dfc47c4a4d6a78fd919f6fc/FLAG57cb4c68f [2020-07-21 01:38:18,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a1f4172/e03ba6a00dfc47c4a4d6a78fd919f6fc [2020-07-21 01:38:18,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 01:38:18,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 01:38:18,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 01:38:18,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 01:38:18,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 01:38:18,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:38:18" (1/1) ... [2020-07-21 01:38:18,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ef5c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:18, skipping insertion in model container [2020-07-21 01:38:18,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:38:18" (1/1) ... [2020-07-21 01:38:18,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 01:38:18,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 01:38:19,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 01:38:19,115 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 01:38:19,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 01:38:19,159 INFO L208 MainTranslator]: Completed translation [2020-07-21 01:38:19,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19 WrapperNode [2020-07-21 01:38:19,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 01:38:19,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 01:38:19,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 01:38:19,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 01:38:19,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (1/1) ... [2020-07-21 01:38:19,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (1/1) ... [2020-07-21 01:38:19,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (1/1) ... [2020-07-21 01:38:19,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (1/1) ... [2020-07-21 01:38:19,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (1/1) ... [2020-07-21 01:38:19,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (1/1) ... [2020-07-21 01:38:19,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (1/1) ... [2020-07-21 01:38:19,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 01:38:19,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 01:38:19,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 01:38:19,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 01:38:19,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (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 01:38:19,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 01:38:19,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 01:38:19,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 01:38:19,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 01:38:19,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 01:38:19,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 01:38:19,369 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 01:38:19,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 01:38:19,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 01:38:19,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 01:38:19,370 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-21 01:38:19,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 01:38:19,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-21 01:38:19,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-21 01:38:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-21 01:38:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 01:38:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 01:38:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 01:38:19,686 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 01:38:19,686 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-21 01:38:19,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:38:19 BoogieIcfgContainer [2020-07-21 01:38:19,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 01:38:19,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 01:38:19,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 01:38:19,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 01:38:19,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:38:18" (1/3) ... [2020-07-21 01:38:19,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e11b356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:38:19, skipping insertion in model container [2020-07-21 01:38:19,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:38:19" (2/3) ... [2020-07-21 01:38:19,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e11b356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:38:19, skipping insertion in model container [2020-07-21 01:38:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:38:19" (3/3) ... [2020-07-21 01:38:19,701 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-21 01:38:19,714 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 01:38:19,722 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 01:38:19,737 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 01:38:19,767 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 01:38:19,767 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 01:38:19,767 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 01:38:19,768 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 01:38:19,768 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 01:38:19,768 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 01:38:19,768 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 01:38:19,768 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 01:38:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-21 01:38:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 01:38:19,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:38:19,799 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 01:38:19,799 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:38:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:38:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-21 01:38:19,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:38:19,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196173223] [2020-07-21 01:38:19,814 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 01:38:19,948 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 01:38:19,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:38:19,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 01:38:19,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:38:19,993 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 01:38:19,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:38:19,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196173223] [2020-07-21 01:38:19,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:38:19,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 01:38:20,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683658693] [2020-07-21 01:38:20,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 01:38:20,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:38:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 01:38:20,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 01:38:20,029 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-21 01:38:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:38:20,063 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-21 01:38:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 01:38:20,065 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-21 01:38:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:38:20,073 INFO L225 Difference]: With dead ends: 58 [2020-07-21 01:38:20,074 INFO L226 Difference]: Without dead ends: 29 [2020-07-21 01:38:20,078 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 01:38:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-21 01:38:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-21 01:38:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-21 01:38:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-21 01:38:20,116 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-21 01:38:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:38:20,117 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-21 01:38:20,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 01:38:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-21 01:38:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 01:38:20,119 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:38:20,119 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 01:38:20,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:38:20,333 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:38:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:38:20,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-21 01:38:20,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:38:20,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [80035597] [2020-07-21 01:38:20,336 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 01:38:20,436 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:38:20,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:38:20,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 01:38:20,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:38:20,523 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:38:20,524 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 01:38:20,526 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:38:20,557 INFO L624 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2020-07-21 01:38:20,562 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 01:38:20,563 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2020-07-21 01:38:20,627 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:38:20,628 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 01:38:20,629 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 01:38:20,642 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-21 01:38:20,642 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 01:38:20,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-21 01:38:20,691 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 01:38:20,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:38:20,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [80035597] [2020-07-21 01:38:20,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:38:20,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-21 01:38:20,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813246445] [2020-07-21 01:38:20,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 01:38:20,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:38:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 01:38:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-21 01:38:20,696 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-21 01:38:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:38:20,888 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-21 01:38:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 01:38:20,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-21 01:38:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:38:20,893 INFO L225 Difference]: With dead ends: 47 [2020-07-21 01:38:20,893 INFO L226 Difference]: Without dead ends: 45 [2020-07-21 01:38:20,894 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 01:38:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-21 01:38:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-21 01:38:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 01:38:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-21 01:38:20,910 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-21 01:38:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:38:20,911 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-21 01:38:20,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 01:38:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-21 01:38:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 01:38:20,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:38:20,913 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 01:38:21,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:38:21,127 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:38:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:38:21,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-21 01:38:21,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:38:21,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1718013723] [2020-07-21 01:38:21,130 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 01:38:21,178 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 01:38:21,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:38:21,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 01:38:21,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:38:21,229 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 01:38:21,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:38:21,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1718013723] [2020-07-21 01:38:21,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:38:21,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 01:38:21,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419562196] [2020-07-21 01:38:21,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 01:38:21,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:38:21,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 01:38:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 01:38:21,232 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-21 01:38:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:38:21,344 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-21 01:38:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 01:38:21,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-21 01:38:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:38:21,348 INFO L225 Difference]: With dead ends: 71 [2020-07-21 01:38:21,349 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 01:38:21,350 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 01:38:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 01:38:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-21 01:38:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 01:38:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-21 01:38:21,360 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-21 01:38:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:38:21,361 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-21 01:38:21,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 01:38:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-21 01:38:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 01:38:21,362 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:38:21,362 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 01:38:21,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:38:21,578 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:38:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:38:21,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-21 01:38:21,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:38:21,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120856997] [2020-07-21 01:38:21,580 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 01:38:21,620 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 01:38:21,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:38:21,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 01:38:21,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:38:21,655 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 01:38:21,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:38:21,709 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 01:38:21,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120856997] [2020-07-21 01:38:21,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:38:21,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 01:38:21,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710157863] [2020-07-21 01:38:21,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 01:38:21,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:38:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 01:38:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 01:38:21,712 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-21 01:38:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:38:21,883 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-21 01:38:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 01:38:21,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-21 01:38:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:38:21,885 INFO L225 Difference]: With dead ends: 66 [2020-07-21 01:38:21,885 INFO L226 Difference]: Without dead ends: 55 [2020-07-21 01:38:21,890 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 01:38:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-21 01:38:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-21 01:38:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-21 01:38:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-21 01:38:21,910 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-21 01:38:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:38:21,911 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-21 01:38:21,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 01:38:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-21 01:38:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 01:38:21,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:38:21,913 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 01:38:22,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:38:22,114 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:38:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:38:22,114 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-21 01:38:22,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:38:22,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [69020660] [2020-07-21 01:38:22,115 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 01:38:22,166 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:38:22,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:38:22,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 01:38:22,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:38:22,189 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 01:38:22,190 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:38:22,197 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:38:22,210 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 01:38:22,210 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:38:22,217 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:38:22,218 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 01:38:22,218 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 01:38:22,282 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 01:38:22,283 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 01:38:22,285 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:38:22,325 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 01:38:22,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:22,330 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 01:38:22,331 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 01:38:22,331 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:22,355 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:22,378 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:22,401 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:22,461 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-21 01:38:22,462 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:22,476 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_2], 20=[|v_#memory_int_16|]} [2020-07-21 01:38:22,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:38:22,490 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-21 01:38:22,490 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 01:38:22,492 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:38:22,537 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:38:22,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:38:22,569 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-21 01:38:22,570 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 01:38:22,572 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:38:22,648 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-21 01:38:22,653 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 01:38:22,653 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-21 01:38:24,092 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-21 01:38:28,280 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-21 01:38:28,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:28,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:38:28,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:38:28,325 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:38:28,338 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:38:28,366 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-21 01:38:28,367 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 01:38:28,372 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:38:28,373 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:38:28,374 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:38:28,420 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-21 01:38:28,422 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 01:38:28,423 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-21 01:38:28,457 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-21 01:38:28,458 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 01:38:28,459 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-21 01:38:28,547 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 01:38:28,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:38:28,599 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:38:38,636 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 01:38:38,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [69020660] [2020-07-21 01:38:38,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:38:38,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-21 01:38:38,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092355794] [2020-07-21 01:38:38,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 01:38:38,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:38:38,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 01:38:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=165, Unknown=5, NotChecked=0, Total=210 [2020-07-21 01:38:38,641 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2020-07-21 01:38:44,967 WARN L193 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-21 01:39:05,329 WARN L193 SmtUtils]: Spent 18.12 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-07-21 01:39:16,608 WARN L193 SmtUtils]: Spent 957.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-07-21 01:39:27,802 WARN L193 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2020-07-21 01:39:32,575 WARN L193 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2020-07-21 01:39:40,524 WARN L193 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2020-07-21 01:39:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:39:40,617 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2020-07-21 01:39:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-21 01:39:40,625 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-21 01:39:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:39:40,628 INFO L225 Difference]: With dead ends: 105 [2020-07-21 01:39:40,628 INFO L226 Difference]: Without dead ends: 103 [2020-07-21 01:39:40,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 65.7s TimeCoverageRelationStatistics Valid=175, Invalid=746, Unknown=9, NotChecked=0, Total=930 [2020-07-21 01:39:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-21 01:39:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 54. [2020-07-21 01:39:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 01:39:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-07-21 01:39:40,649 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 26 [2020-07-21 01:39:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:39:40,649 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-07-21 01:39:40,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 01:39:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-21 01:39:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 01:39:40,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:39:40,651 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 01:39:40,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:39:40,854 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:39:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:39:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-21 01:39:40,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:39:40,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [593881144] [2020-07-21 01:39:40,857 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 01:39:40,901 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:39:40,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:39:40,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 01:39:40,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:39:40,946 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 01:39:40,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 01:39:40,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [593881144] [2020-07-21 01:39:40,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 01:39:40,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 01:39:40,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637086508] [2020-07-21 01:39:40,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 01:39:40,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:39:40,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 01:39:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 01:39:40,951 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 6 states. [2020-07-21 01:39:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:39:41,231 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2020-07-21 01:39:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 01:39:41,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-21 01:39:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:39:41,233 INFO L225 Difference]: With dead ends: 80 [2020-07-21 01:39:41,233 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 01:39:41,234 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 01:39:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 01:39:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2020-07-21 01:39:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 01:39:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-21 01:39:41,245 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2020-07-21 01:39:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:39:41,246 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-21 01:39:41,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 01:39:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-21 01:39:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 01:39:41,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:39:41,247 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 01:39:41,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:39:41,461 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:39:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:39:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2074868861, now seen corresponding path program 2 times [2020-07-21 01:39:41,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:39:41,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1516857107] [2020-07-21 01:39:41,462 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 01:39:41,506 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 01:39:41,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:39:41,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 01:39:41,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:39:41,550 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 01:39:41,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:39:41,610 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 01:39:41,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1516857107] [2020-07-21 01:39:41,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:39:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-21 01:39:41,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757793472] [2020-07-21 01:39:41,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 01:39:41,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:39:41,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 01:39:41,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-21 01:39:41,613 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 9 states. [2020-07-21 01:39:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:39:42,105 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-21 01:39:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 01:39:42,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-21 01:39:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:39:42,109 INFO L225 Difference]: With dead ends: 98 [2020-07-21 01:39:42,109 INFO L226 Difference]: Without dead ends: 76 [2020-07-21 01:39:42,110 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 01:39:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-21 01:39:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-07-21 01:39:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 01:39:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-07-21 01:39:42,122 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2020-07-21 01:39:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:39:42,123 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-07-21 01:39:42,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 01:39:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-21 01:39:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 01:39:42,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:39:42,124 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 01:39:42,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:39:42,338 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:39:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:39:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-21 01:39:42,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:39:42,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20518441] [2020-07-21 01:39:42,339 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 01:39:42,390 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:39:42,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:39:42,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 01:39:42,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:39:42,424 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 01:39:42,425 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:42,460 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:39:42,468 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 01:39:42,468 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:42,509 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:39:42,509 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 01:39:42,509 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 01:39:42,716 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-07-21 01:39:42,717 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 01:39:42,717 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 01:39:42,719 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:42,917 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-07-21 01:39:42,918 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 01:39:42,918 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:42,920 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 01:39:42,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 01:39:42,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:43,022 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:43,126 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:43,128 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:43,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:43,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:43,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:43,597 INFO L244 Elim1Store]: Index analysis took 403 ms [2020-07-21 01:39:43,722 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-07-21 01:39:43,723 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:39:43,723 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 01:39:43,726 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 01:39:43,726 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:39:43,727 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:39:43,728 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:39:43,729 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:39:43,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:43,731 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:43,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:44,304 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-21 01:39:44,305 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-21 01:39:44,306 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 01:39:44,308 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-21 01:39:44,309 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:39:44,310 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 01:39:44,310 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:39:44,311 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 01:39:44,312 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:39:44,313 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:39:44,313 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:39:44,314 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:39:44,314 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:44,317 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:45,125 WARN L193 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2020-07-21 01:39:45,126 INFO L624 ElimStorePlain]: treesize reduction 803, result has 14.5 percent of original size [2020-07-21 01:39:45,128 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:45,130 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 01:39:45,131 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-21 01:39:45,131 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:45,569 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-21 01:39:45,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:45,781 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:45,998 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:39:46,563 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-21 01:39:46,566 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 01:39:46,618 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:46,619 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:46,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:46,632 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:46,699 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:46,721 INFO L244 Elim1Store]: Index analysis took 104 ms [2020-07-21 01:39:46,757 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-21 01:39:46,758 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 01:39:46,760 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:46,821 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:46,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:46,835 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:46,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:46,870 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:46,939 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:47,005 INFO L244 Elim1Store]: Index analysis took 184 ms [2020-07-21 01:39:47,015 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 01:39:47,016 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:47,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:47,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:47,068 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:39:47,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:47,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:47,084 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 01:39:47,085 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:47,884 WARN L193 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-07-21 01:39:47,885 INFO L624 ElimStorePlain]: treesize reduction 71, result has 74.9 percent of original size [2020-07-21 01:39:47,886 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 01:39:47,887 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:212 [2020-07-21 01:39:50,589 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-07-21 01:39:50,591 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-21 01:39:50,591 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 01:39:51,289 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-07-21 01:39:51,292 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 01:39:51,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:51,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:51,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:51,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:51,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:51,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:51,807 INFO L244 Elim1Store]: Index analysis took 414 ms [2020-07-21 01:39:51,970 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-21 01:39:51,973 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-21 01:39:51,973 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 01:39:51,976 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:52,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,395 INFO L244 Elim1Store]: Index analysis took 353 ms [2020-07-21 01:39:52,420 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:39:52,420 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 01:39:52,421 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:52,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:39:52,499 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:39:52,499 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 01:39:52,501 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 01:39:53,075 WARN L193 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-07-21 01:39:53,077 INFO L624 ElimStorePlain]: treesize reduction 210, result has 54.4 percent of original size [2020-07-21 01:39:53,083 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 01:39:53,084 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:274, output treesize:251 [2020-07-21 01:40:11,854 WARN L193 SmtUtils]: Spent 9.70 s on a formula simplification that was a NOOP. DAG size: 101 [2020-07-21 01:40:26,512 WARN L193 SmtUtils]: Spent 14.37 s on a formula simplification that was a NOOP. DAG size: 105 [2020-07-21 01:40:26,517 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 01:40:26,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,616 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:40:26,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,633 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:40:26,823 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-07-21 01:40:26,824 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-21 01:40:26,825 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 01:40:26,828 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:26,828 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:26,832 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 01:40:26,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,898 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:40:26,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:26,913 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:40:27,214 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-21 01:40:27,215 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-21 01:40:27,216 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 01:40:27,218 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,218 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,219 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 01:40:27,220 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,220 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,221 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,222 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 01:40:27,223 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,226 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,241 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,241 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,245 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,245 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,246 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,253 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,254 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,268 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 01:40:27,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:27,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:27,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:27,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:27,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:27,311 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:40:27,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:40:27,662 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-21 01:40:27,663 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-21 01:40:27,663 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 01:40:27,666 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 01:40:27,666 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:40:27,667 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,667 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,667 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,668 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,669 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,669 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,670 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,671 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,671 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,672 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,673 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,674 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,674 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,678 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,678 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,680 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,681 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,682 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,682 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,683 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,689 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,690 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,691 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,691 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,693 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 01:40:27,694 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:40:27,695 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,695 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,696 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,696 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,697 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,698 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,700 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,700 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,701 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,701 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,702 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,703 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,704 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,705 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,706 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,706 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,707 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,708 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,709 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,709 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,710 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,711 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,715 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,716 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,717 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,718 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,718 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,719 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,719 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,721 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 01:40:27,721 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:40:27,722 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,722 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,724 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,725 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,725 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,727 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 01:40:27,727 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:40:27,728 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 01:40:28,815 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 119 DAG size of output: 67 [2020-07-21 01:40:28,816 INFO L624 ElimStorePlain]: treesize reduction 141, result has 48.0 percent of original size [2020-07-21 01:40:28,844 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 01:40:28,844 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:293, output treesize:7 [2020-07-21 01:40:29,274 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 01:40:29,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:40:29,433 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:40:34,126 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 01:40:36,145 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 01:40:38,176 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 01:40:40,238 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 01:40:42,426 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 01:40:42,559 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 01:40:42,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20518441] [2020-07-21 01:40:42,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:40:42,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-21 01:40:42,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398207736] [2020-07-21 01:40:42,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 01:40:42,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:40:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 01:40:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=223, Unknown=9, NotChecked=170, Total=462 [2020-07-21 01:40:42,563 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 22 states. [2020-07-21 01:40:46,801 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 01:40:49,056 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 01:40:51,100 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 01:40:53,284 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 01:40:55,388 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 01:41:11,647 WARN L193 SmtUtils]: Spent 12.71 s on a formula simplification. DAG size of input: 123 DAG size of output: 122 [2020-07-21 01:41:14,216 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-21 01:41:19,122 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-21 01:41:30,285 WARN L193 SmtUtils]: Spent 10.17 s on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2020-07-21 01:41:45,150 WARN L193 SmtUtils]: Spent 12.01 s on a formula simplification. DAG size of input: 134 DAG size of output: 134 [2020-07-21 01:42:13,329 WARN L193 SmtUtils]: Spent 17.46 s on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2020-07-21 01:42:23,005 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-07-21 01:42:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:42:29,261 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2020-07-21 01:42:29,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-21 01:42:29,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-07-21 01:42:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:42:29,282 INFO L225 Difference]: With dead ends: 90 [2020-07-21 01:42:29,283 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 01:42:29,284 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 127.1s TimeCoverageRelationStatistics Valid=129, Invalid=493, Unknown=18, NotChecked=550, Total=1190 [2020-07-21 01:42:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 01:42:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 01:42:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 01:42:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-07-21 01:42:29,301 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2020-07-21 01:42:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:42:29,301 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-07-21 01:42:29,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 01:42:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-07-21 01:42:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-21 01:42:29,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:42:29,303 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 01:42:29,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:42:29,505 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:42:29,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:42:29,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 4 times [2020-07-21 01:42:29,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:42:29,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354446504] [2020-07-21 01:42:29,507 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 01:42:29,568 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:42:29,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:42:29,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 01:42:29,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:42:29,665 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 01:42:29,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:42:29,733 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 01:42:29,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354446504] [2020-07-21 01:42:29,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:42:29,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-21 01:42:29,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941239799] [2020-07-21 01:42:29,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 01:42:29,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:42:29,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 01:42:29,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-21 01:42:29,736 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 12 states. [2020-07-21 01:42:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:42:30,713 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2020-07-21 01:42:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 01:42:30,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-21 01:42:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:42:30,721 INFO L225 Difference]: With dead ends: 113 [2020-07-21 01:42:30,721 INFO L226 Difference]: Without dead ends: 95 [2020-07-21 01:42:30,722 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 01:42:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-21 01:42:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2020-07-21 01:42:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 01:42:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 01:42:30,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2020-07-21 01:42:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:42:30,753 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 01:42:30,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 01:42:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 01:42:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-21 01:42:30,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:42:30,757 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 01:42:30,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:42:30,958 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:42:30,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:42:30,958 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-21 01:42:30,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:42:30,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376861465] [2020-07-21 01:42:30,959 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 01:42:31,028 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:42:31,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 01:42:31,029 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 01:42:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 01:42:31,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 01:42:31,073 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 01:42:31,073 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 01:42:31,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:42:31,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:42:31 BoogieIcfgContainer [2020-07-21 01:42:31,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 01:42:31,323 INFO L168 Benchmark]: Toolchain (without parser) took 252453.78 ms. Allocated memory was 137.4 MB in the beginning and 267.4 MB in the end (delta: 130.0 MB). Free memory was 102.2 MB in the beginning and 215.4 MB in the end (delta: -113.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2020-07-21 01:42:31,323 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 01:42:31,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.60 ms. Allocated memory is still 137.4 MB. Free memory was 101.7 MB in the beginning and 91.4 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-21 01:42:31,324 INFO L168 Benchmark]: Boogie Preprocessor took 136.65 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.4 MB in the beginning and 179.7 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-21 01:42:31,324 INFO L168 Benchmark]: RCFGBuilder took 394.10 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 162.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2020-07-21 01:42:31,325 INFO L168 Benchmark]: TraceAbstraction took 251628.50 ms. Allocated memory was 202.4 MB in the beginning and 267.4 MB in the end (delta: 65.0 MB). Free memory was 162.8 MB in the beginning and 215.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-21 01:42:31,327 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.60 ms. Allocated memory is still 137.4 MB. Free memory was 101.7 MB in the beginning and 91.4 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.65 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.4 MB in the beginning and 179.7 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 394.10 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 162.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251628.50 ms. Allocated memory was 202.4 MB in the beginning and 267.4 MB in the end (delta: 65.0 MB). Free memory was 162.8 MB in the beginning and 215.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=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={-1:0}, b={-2:0}, i=1, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=2] [L32] COND TRUE i