/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 NUM_VARIABLES --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/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 17:41:01,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 17:41:01,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 17:41:01,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 17:41:01,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 17:41:01,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 17:41:01,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 17:41:01,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 17:41:01,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 17:41:01,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 17:41:01,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 17:41:01,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 17:41:01,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 17:41:01,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 17:41:01,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 17:41:01,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 17:41:01,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 17:41:01,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 17:41:01,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 17:41:01,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 17:41:01,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 17:41:01,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 17:41:01,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 17:41:01,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 17:41:01,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 17:41:01,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 17:41:01,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 17:41:01,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 17:41:01,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 17:41:01,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 17:41:01,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 17:41:01,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 17:41:01,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 17:41:01,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 17:41:01,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 17:41:01,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 17:41:01,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 17:41:01,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 17:41:01,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 17:41:01,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 17:41:01,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 17:41:01,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 17:41:01,579 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 17:41:01,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 17:41:01,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 17:41:01,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 17:41:01,585 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 17:41:01,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 17:41:01,586 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 17:41:01,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 17:41:01,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 17:41:01,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 17:41:01,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 17:41:01,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 17:41:01,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 17:41:01,588 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 17:41:01,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 17:41:01,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 17:41:01,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 17:41:01,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 17:41:01,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 17:41:01,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 17:41:01,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 17:41:01,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 17:41:01,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 17:41:01,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 17:41:01,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 17:41:01,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 17:41:01,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:41:01,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 17:41:01,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 17:41:01,592 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 -> NUM_VARIABLES 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-20 17:41:01,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 17:41:01,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 17:41:01,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 17:41:01,906 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 17:41:01,906 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 17:41:01,907 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-1.c [2020-07-20 17:41:01,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e812af9f/c624af793ce547a689c153fd9e10e2c8/FLAGb19d20d1e [2020-07-20 17:41:02,480 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 17:41:02,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2020-07-20 17:41:02,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e812af9f/c624af793ce547a689c153fd9e10e2c8/FLAGb19d20d1e [2020-07-20 17:41:02,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e812af9f/c624af793ce547a689c153fd9e10e2c8 [2020-07-20 17:41:02,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 17:41:02,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 17:41:02,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 17:41:02,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 17:41:02,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 17:41:02,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:41:02" (1/1) ... [2020-07-20 17:41:02,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4d41dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:02, skipping insertion in model container [2020-07-20 17:41:02,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:41:02" (1/1) ... [2020-07-20 17:41:02,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 17:41:02,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 17:41:03,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 17:41:03,084 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 17:41:03,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 17:41:03,130 INFO L208 MainTranslator]: Completed translation [2020-07-20 17:41:03,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03 WrapperNode [2020-07-20 17:41:03,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 17:41:03,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 17:41:03,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 17:41:03,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 17:41:03,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... [2020-07-20 17:41:03,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... [2020-07-20 17:41:03,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... [2020-07-20 17:41:03,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... [2020-07-20 17:41:03,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... [2020-07-20 17:41:03,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... [2020-07-20 17:41:03,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... [2020-07-20 17:41:03,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 17:41:03,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 17:41:03,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 17:41:03,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 17:41:03,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 17:41:03,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 17:41:03,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 17:41:03,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 17:41:03,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 17:41:03,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 17:41:03,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 17:41:03,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 17:41:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 17:41:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-20 17:41:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 17:41:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 17:41:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 17:41:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 17:41:03,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 17:41:03,634 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 17:41:03,635 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-20 17:41:03,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:41:03 BoogieIcfgContainer [2020-07-20 17:41:03,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 17:41:03,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 17:41:03,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 17:41:03,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 17:41:03,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:41:02" (1/3) ... [2020-07-20 17:41:03,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e6277b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:41:03, skipping insertion in model container [2020-07-20 17:41:03,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:41:03" (2/3) ... [2020-07-20 17:41:03,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e6277b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:41:03, skipping insertion in model container [2020-07-20 17:41:03,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:41:03" (3/3) ... [2020-07-20 17:41:03,649 INFO L109 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2020-07-20 17:41:03,662 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 17:41:03,671 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 17:41:03,697 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 17:41:03,724 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 17:41:03,725 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 17:41:03,725 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 17:41:03,725 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 17:41:03,725 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 17:41:03,726 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 17:41:03,726 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 17:41:03,726 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 17:41:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 17:41:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-20 17:41:03,754 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:41:03,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:41:03,755 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:41:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:41:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1330517862, now seen corresponding path program 1 times [2020-07-20 17:41:03,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:41:03,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628212743] [2020-07-20 17:41:03,773 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-20 17:41:03,920 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:41:03,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:41:03,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 17:41:03,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:41:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:41:03,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:41:03,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [628212743] [2020-07-20 17:41:03,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:41:03,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 17:41:03,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978109116] [2020-07-20 17:41:03,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 17:41:03,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:41:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 17:41:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 17:41:03,978 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-20 17:41:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:41:03,999 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-07-20 17:41:04,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 17:41:04,001 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-20 17:41:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:41:04,010 INFO L225 Difference]: With dead ends: 42 [2020-07-20 17:41:04,011 INFO L226 Difference]: Without dead ends: 17 [2020-07-20 17:41:04,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 17:41:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-20 17:41:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-20 17:41:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-20 17:41:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-20 17:41:04,050 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-07-20 17:41:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:41:04,051 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-20 17:41:04,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 17:41:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-20 17:41:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-20 17:41:04,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:41:04,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:41:04,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:41:04,255 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:41:04,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:41:04,256 INFO L82 PathProgramCache]: Analyzing trace with hash 672047389, now seen corresponding path program 1 times [2020-07-20 17:41:04,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:41:04,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136221320] [2020-07-20 17:41:04,257 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-20 17:41:04,316 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 17:41:04,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:41:04,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 17:41:04,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:41:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:41:04,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:41:04,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136221320] [2020-07-20 17:41:04,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:41:04,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 17:41:04,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878891361] [2020-07-20 17:41:04,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 17:41:04,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:41:04,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 17:41:04,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 17:41:04,364 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2020-07-20 17:41:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:41:04,402 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-20 17:41:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 17:41:04,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-20 17:41:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:41:04,405 INFO L225 Difference]: With dead ends: 28 [2020-07-20 17:41:04,405 INFO L226 Difference]: Without dead ends: 22 [2020-07-20 17:41:04,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 17:41:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-20 17:41:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-07-20 17:41:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-20 17:41:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-20 17:41:04,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2020-07-20 17:41:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:41:04,414 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-20 17:41:04,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 17:41:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-20 17:41:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-20 17:41:04,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:41:04,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:41:04,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:41:04,630 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:41:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:41:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash -830834987, now seen corresponding path program 1 times [2020-07-20 17:41:04,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:41:04,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669083746] [2020-07-20 17:41:04,633 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-20 17:41:04,678 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 17:41:04,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:41:04,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 17:41:04,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:41:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:41:04,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 17:41:04,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669083746] [2020-07-20 17:41:04,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 17:41:04,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 17:41:04,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084671901] [2020-07-20 17:41:04,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 17:41:04,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:41:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 17:41:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-20 17:41:04,722 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2020-07-20 17:41:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:41:04,785 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-20 17:41:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 17:41:04,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-20 17:41:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:41:04,790 INFO L225 Difference]: With dead ends: 32 [2020-07-20 17:41:04,790 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 17:41:04,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-20 17:41:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 17:41:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-20 17:41:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-20 17:41:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-20 17:41:04,803 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2020-07-20 17:41:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:41:04,803 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-20 17:41:04,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 17:41:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-20 17:41:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-20 17:41:04,805 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:41:04,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:41:05,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:41:05,007 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:41:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:41:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1529445450, now seen corresponding path program 1 times [2020-07-20 17:41:05,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:41:05,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1764728823] [2020-07-20 17:41:05,009 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-20 17:41:05,100 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:41:05,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:41:05,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-20 17:41:05,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:41:05,260 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2020-07-20 17:41:05,261 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:05,605 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 31 [2020-07-20 17:41:05,610 INFO L624 ElimStorePlain]: treesize reduction 433, result has 7.7 percent of original size [2020-07-20 17:41:05,610 INFO L512 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2020-07-20 17:41:05,610 INFO L512 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2020-07-20 17:41:05,611 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2020-07-20 17:41:05,611 INFO L512 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2020-07-20 17:41:05,611 INFO L512 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2020-07-20 17:41:05,614 INFO L512 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2020-07-20 17:41:05,614 INFO L512 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2020-07-20 17:41:05,616 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:05,616 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 16 variables, input treesize:473, output treesize:14 [2020-07-20 17:41:05,643 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:41:05,754 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:05,755 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 21 treesize of output 21 [2020-07-20 17:41:05,759 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:41:05,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:41:05,763 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 17:41:05,785 INFO L624 ElimStorePlain]: treesize reduction 16, result has 36.0 percent of original size [2020-07-20 17:41:05,787 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:05,787 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:3 [2020-07-20 17:41:05,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:41:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:41:05,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:41:05,862 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:05,892 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:05,894 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:05,895 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:05,898 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:05,901 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:05,902 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:05,904 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,599 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-20 17:41:06,646 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,649 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,654 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,660 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,663 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,677 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,688 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,691 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,702 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,709 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,711 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,717 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,727 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,739 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,741 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,749 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,759 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,760 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,763 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,765 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,769 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,775 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,776 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,779 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,785 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,788 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,789 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,799 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,803 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,805 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,808 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,820 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,821 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,822 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,828 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,830 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,849 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,851 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,853 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,857 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,858 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,859 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,861 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,864 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,865 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,867 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,871 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,872 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,873 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,874 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,877 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,879 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,880 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,883 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,886 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,887 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,888 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,890 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,893 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,894 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,896 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:06,979 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 69 [2020-07-20 17:41:06,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:06,997 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:07,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:07,015 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:07,027 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 7 treesize of output 5 [2020-07-20 17:41:07,028 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,030 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:07,030 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,049 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,049 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,068 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,068 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,091 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,091 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,110 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,111 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,129 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,130 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,148 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,148 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,189 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,189 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,206 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,207 INFO L544 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,222 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,223 INFO L544 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,239 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,239 INFO L544 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,254 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,255 INFO L544 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,270 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,271 INFO L544 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,286 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,287 INFO L544 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,302 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,303 INFO L544 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,319 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,319 INFO L544 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,333 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,334 INFO L544 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,348 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,348 INFO L544 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,363 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,363 INFO L544 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,377 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,378 INFO L544 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,393 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,393 INFO L544 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,407 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,407 INFO L544 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,420 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,421 INFO L544 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,435 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,435 INFO L544 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,449 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,449 INFO L544 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,463 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,463 INFO L544 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,478 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,478 INFO L544 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,496 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 79 treesize of output 75 [2020-07-20 17:41:07,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:07,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:07,915 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 56 treesize of output 54 [2020-07-20 17:41:07,916 INFO L544 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,924 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:07,925 INFO L544 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,944 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,945 INFO L544 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,961 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,962 INFO L544 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:07,981 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:07,982 INFO L544 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:08,000 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:08,000 INFO L544 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:08,015 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:08,016 INFO L544 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:08,033 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:08,034 INFO L544 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:08,051 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:08,052 INFO L544 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:08,067 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:08,068 INFO L544 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:08,084 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:08,084 INFO L544 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:08,104 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 76 treesize of output 72 [2020-07-20 17:41:08,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:08,570 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:08,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:10,612 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= (+ |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) |main_~#matriz~0.offset|) [2020-07-20 17:41:10,639 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 54 treesize of output 52 [2020-07-20 17:41:10,640 INFO L544 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,655 INFO L624 ElimStorePlain]: treesize reduction 21, result has 4.5 percent of original size [2020-07-20 17:41:10,656 INFO L544 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,670 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,670 INFO L544 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 66 [2020-07-20 17:41:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:10,705 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:10,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:10,726 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:10,737 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 7 treesize of output 5 [2020-07-20 17:41:10,738 INFO L544 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,739 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:10,740 INFO L544 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,755 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,755 INFO L544 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,769 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,769 INFO L544 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,782 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,782 INFO L544 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,794 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,795 INFO L544 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,806 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,807 INFO L544 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,819 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,819 INFO L544 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,833 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,833 INFO L544 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,849 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,849 INFO L544 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,889 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,889 INFO L544 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,904 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,904 INFO L544 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,912 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,913 INFO L544 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,920 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,920 INFO L544 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,928 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,928 INFO L544 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,937 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,938 INFO L544 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,945 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,946 INFO L544 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,954 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:10,954 INFO L544 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:10,966 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 66 [2020-07-20 17:41:10,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:10,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:11,007 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 50 treesize of output 48 [2020-07-20 17:41:11,008 INFO L544 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,013 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:11,013 INFO L544 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,022 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:11,022 INFO L544 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,031 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:11,031 INFO L544 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,039 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:11,040 INFO L544 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,050 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 60 [2020-07-20 17:41:11,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:11,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:11,073 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 46 treesize of output 44 [2020-07-20 17:41:11,074 INFO L544 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,079 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:11,080 INFO L544 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,087 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:11,087 INFO L544 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,093 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:11,094 INFO L544 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:11,099 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:11,099 INFO L544 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:19,733 WARN L193 SmtUtils]: Spent 8.63 s on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-07-20 17:41:19,734 INFO L624 ElimStorePlain]: treesize reduction 213, result has 30.2 percent of original size [2020-07-20 17:41:19,744 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2020-07-20 17:41:19,744 INFO L244 ElimStorePlain]: Needed 71 recursive calls to eliminate 5 variables, input treesize:7169, output treesize:92 [2020-07-20 17:41:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:41:20,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1764728823] [2020-07-20 17:41:20,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:41:20,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2020-07-20 17:41:20,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710077026] [2020-07-20 17:41:20,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 17:41:20,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:41:20,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 17:41:20,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-20 17:41:20,638 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 11 states. [2020-07-20 17:41:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:41:24,131 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-20 17:41:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 17:41:24,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-07-20 17:41:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:41:24,133 INFO L225 Difference]: With dead ends: 35 [2020-07-20 17:41:24,133 INFO L226 Difference]: Without dead ends: 29 [2020-07-20 17:41:24,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-07-20 17:41:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-20 17:41:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-20 17:41:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-20 17:41:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-07-20 17:41:24,141 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2020-07-20 17:41:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:41:24,142 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-07-20 17:41:24,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 17:41:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-20 17:41:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-20 17:41:24,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:41:24,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:41:24,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:41:24,344 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:41:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:41:24,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1922472460, now seen corresponding path program 1 times [2020-07-20 17:41:24,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:41:24,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1020934350] [2020-07-20 17:41:24,346 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-20 17:41:24,393 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 17:41:24,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:41:24,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-20 17:41:24,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:41:24,423 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:41:24,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:41:24,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:41:24,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,427 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,428 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:41:24,429 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,430 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,432 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 17:41:24,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,434 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,436 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,437 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 17:41:24,457 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-20 17:41:24,457 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:24,465 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-20 17:41:24,466 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:24,475 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-20 17:41:24,475 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:24,482 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-20 17:41:24,482 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:24,655 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 38 [2020-07-20 17:41:24,657 INFO L624 ElimStorePlain]: treesize reduction 843, result has 5.7 percent of original size [2020-07-20 17:41:24,657 INFO L512 ElimStorePlain]: Eliminatee v_prenex_22 vanished before elimination [2020-07-20 17:41:24,657 INFO L512 ElimStorePlain]: Eliminatee v_prenex_18 vanished before elimination [2020-07-20 17:41:24,664 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2020-07-20 17:41:24,665 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:24,681 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:24,683 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-20 17:41:24,683 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:1193, output treesize:29 [2020-07-20 17:41:24,778 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:24,778 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 28 treesize of output 28 [2020-07-20 17:41:24,779 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:41:24,780 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:41:24,781 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 17:41:24,814 INFO L624 ElimStorePlain]: treesize reduction 16, result has 50.0 percent of original size [2020-07-20 17:41:24,818 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:24,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:5 [2020-07-20 17:41:24,840 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 17:41:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:41:24,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:41:24,937 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,032 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,033 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,033 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,034 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,036 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,036 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,037 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,040 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,041 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,042 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,043 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,043 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,044 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,045 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,047 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,048 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,050 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,052 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,053 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,054 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,055 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,057 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,058 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,059 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,061 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,062 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,063 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,064 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,065 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,067 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,068 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,069 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,071 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,072 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,072 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,074 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,075 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,076 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,078 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,080 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,081 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,082 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,083 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,083 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,085 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,087 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,087 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,089 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,091 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,091 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,092 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,093 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,095 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,096 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,097 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,099 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,100 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,101 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,102 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,108 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,109 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,110 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,112 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,113 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,113 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,115 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,117 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,118 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,119 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 17:41:25,175 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:25,176 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:25,189 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:25,189 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:25,204 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:25,204 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:25,218 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:25,218 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:25,236 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:25,236 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:25,250 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:25,250 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:25,268 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 76 treesize of output 72 [2020-07-20 17:41:25,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:25,376 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:25,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:25,987 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:26,000 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 7 treesize of output 5 [2020-07-20 17:41:26,000 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,003 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:26,003 INFO L544 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,016 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,017 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,034 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,034 INFO L544 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,054 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,055 INFO L544 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,071 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,071 INFO L544 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,087 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,087 INFO L544 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,109 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 66 [2020-07-20 17:41:26,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,184 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 50 treesize of output 48 [2020-07-20 17:41:26,185 INFO L544 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,193 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:26,194 INFO L544 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,229 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,229 INFO L544 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 60 [2020-07-20 17:41:26,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,279 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 46 treesize of output 44 [2020-07-20 17:41:26,280 INFO L544 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,286 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:26,287 INFO L544 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,300 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,301 INFO L544 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,313 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,314 INFO L544 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,326 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,327 INFO L544 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,340 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,340 INFO L544 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,352 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,353 INFO L544 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,365 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,366 INFO L544 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,378 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,378 INFO L544 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,397 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,398 INFO L544 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,411 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,411 INFO L544 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,425 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,425 INFO L544 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,438 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,438 INFO L544 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,451 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,451 INFO L544 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,463 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,464 INFO L544 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,475 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,476 INFO L544 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,488 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,488 INFO L544 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,500 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,501 INFO L544 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,511 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,512 INFO L544 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,531 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,531 INFO L544 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,547 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,547 INFO L544 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,559 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,559 INFO L544 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,570 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,571 INFO L544 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,584 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,584 INFO L544 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,601 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 69 [2020-07-20 17:41:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,616 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:26,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,628 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:26,641 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 7 treesize of output 5 [2020-07-20 17:41:26,642 INFO L544 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,643 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:26,643 INFO L544 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,657 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,658 INFO L544 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,670 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,670 INFO L544 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,682 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,682 INFO L544 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,694 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,695 INFO L544 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,706 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,706 INFO L544 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,717 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,717 INFO L544 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,735 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,736 INFO L544 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,746 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,747 INFO L544 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,757 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,758 INFO L544 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,769 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,769 INFO L544 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,782 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,783 INFO L544 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,797 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,798 INFO L544 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,809 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,809 INFO L544 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,820 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,820 INFO L544 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,831 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:26,831 INFO L544 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,845 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 66 [2020-07-20 17:41:26,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,860 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:26,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,873 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 17:41:26,882 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 7 treesize of output 5 [2020-07-20 17:41:26,883 INFO L544 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,885 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:26,886 INFO L544 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:26,900 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 79 treesize of output 75 [2020-07-20 17:41:26,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:26,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 17:41:27,074 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 56 treesize of output 54 [2020-07-20 17:41:27,075 INFO L544 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,087 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 17:41:27,087 INFO L544 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,098 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,098 INFO L544 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,108 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,108 INFO L544 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,120 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,120 INFO L544 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,128 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,129 INFO L544 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,136 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,137 INFO L544 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,144 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,145 INFO L544 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,152 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,153 INFO L544 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,160 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,160 INFO L544 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:27,166 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-07-20 17:41:27,167 INFO L544 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2020-07-20 17:41:36,180 WARN L193 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2020-07-20 17:41:36,181 INFO L624 ElimStorePlain]: treesize reduction 185, result has 41.1 percent of original size [2020-07-20 17:41:36,187 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2020-07-20 17:41:36,187 INFO L244 ElimStorePlain]: Needed 71 recursive calls to eliminate 5 variables, input treesize:7265, output treesize:129 [2020-07-20 17:41:39,434 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 82 DAG size of output: 23 [2020-07-20 17:41:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 17:41:39,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1020934350] [2020-07-20 17:41:39,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:41:39,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-20 17:41:39,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139132365] [2020-07-20 17:41:39,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 17:41:39,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:41:39,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 17:41:39,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-20 17:41:39,554 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 14 states. [2020-07-20 17:41:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:41:40,123 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-20 17:41:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 17:41:40,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-07-20 17:41:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:41:40,130 INFO L225 Difference]: With dead ends: 38 [2020-07-20 17:41:40,130 INFO L226 Difference]: Without dead ends: 32 [2020-07-20 17:41:40,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-20 17:41:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-20 17:41:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-20 17:41:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-20 17:41:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-07-20 17:41:40,138 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2020-07-20 17:41:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:41:40,138 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-07-20 17:41:40,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 17:41:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-20 17:41:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 17:41:40,139 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 17:41:40,139 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 17:41:40,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:41:40,342 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 17:41:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 17:41:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash 239488911, now seen corresponding path program 2 times [2020-07-20 17:41:40,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 17:41:40,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820807193] [2020-07-20 17:41:40,344 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-20 17:41:40,398 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 17:41:40,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 17:41:40,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 17:41:40,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 17:41:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 17:41:40,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 17:41:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 17:41:40,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820807193] [2020-07-20 17:41:40,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 17:41:40,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-20 17:41:40,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059426401] [2020-07-20 17:41:40,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 17:41:40,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 17:41:40,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 17:41:40,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 17:41:40,500 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 6 states. [2020-07-20 17:41:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 17:41:40,538 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-20 17:41:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 17:41:40,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-20 17:41:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 17:41:40,542 INFO L225 Difference]: With dead ends: 29 [2020-07-20 17:41:40,542 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 17:41:40,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 17:41:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 17:41:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 17:41:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 17:41:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 17:41:40,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-20 17:41:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 17:41:40,546 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 17:41:40,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 17:41:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 17:41:40,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 17:41:40,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 17:41:40,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 17:41:41,015 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-07-20 17:41:41,146 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 17:41:41,146 INFO L271 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2020-07-20 17:41:41,146 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 17:41:41,146 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 17:41:41,146 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-20 17:41:41,146 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 17:41:41,147 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 17:41:41,147 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2020-07-20 17:41:41,147 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2020-07-20 17:41:41,147 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (= 1 main_~N_LIN~0))) (or (and (< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ main_~maior~0 1)) .cse0 (= 1 main_~j~0) .cse1) (and .cse0 (= 0 main_~j~0) .cse1))) [2020-07-20 17:41:41,147 INFO L268 CegarLoopResult]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2020-07-20 17:41:41,147 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2020-07-20 17:41:41,147 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2020-07-20 17:41:41,147 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= |main_#t~mem6| main_~maior~0) (exists ((main_~k~0 Int)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4))) main_~maior~0) (< (mod main_~k~0 4294967296) 1) (<= (mod main_~k~0 4294967296) 2147483647))) (= 1 main_~N_LIN~0)) [2020-07-20 17:41:41,147 INFO L268 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-07-20 17:41:41,148 INFO L268 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-07-20 17:41:41,148 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 26) no Hoare annotation was computed. [2020-07-20 17:41:41,148 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (= 0 main_~j~0)) (.cse2 (= 1 main_~N_LIN~0))) (or (and .cse0 .cse1 .cse2 (exists ((main_~k~0 Int)) (and (< (mod main_~k~0 4294967296) 1) (<= (mod main_~k~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0)))) (and (= 0 main_~k~0) .cse0 .cse1 .cse2))) [2020-07-20 17:41:41,148 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-20 17:41:41,148 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-20 17:41:41,148 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-20 17:41:41,148 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-20 17:41:41,148 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-20 17:41:41,148 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-20 17:41:41,156 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,157 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-20 17:41:41,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-20 17:41:41,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-20 17:41:41,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-20 17:41:41,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:41:41 BoogieIcfgContainer [2020-07-20 17:41:41,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 17:41:41,171 INFO L168 Benchmark]: Toolchain (without parser) took 38350.59 ms. Allocated memory was 138.9 MB in the beginning and 282.6 MB in the end (delta: 143.7 MB). Free memory was 104.0 MB in the beginning and 153.6 MB in the end (delta: -49.6 MB). Peak memory consumption was 94.1 MB. Max. memory is 7.1 GB. [2020-07-20 17:41:41,172 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-20 17:41:41,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.22 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 93.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-20 17:41:41,173 INFO L168 Benchmark]: Boogie Preprocessor took 144.06 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.5 MB in the beginning and 180.4 MB in the end (delta: -87.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-20 17:41:41,174 INFO L168 Benchmark]: RCFGBuilder took 364.43 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 165.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2020-07-20 17:41:41,175 INFO L168 Benchmark]: TraceAbstraction took 37528.12 ms. Allocated memory was 202.9 MB in the beginning and 282.6 MB in the end (delta: 79.7 MB). Free memory was 164.3 MB in the beginning and 153.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2020-07-20 17:41:41,178 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.22 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 93.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.06 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.5 MB in the beginning and 180.4 MB in the end (delta: -87.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.43 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 165.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37528.12 ms. Allocated memory was 202.9 MB in the beginning and 282.6 MB in the end (delta: 79.7 MB). Free memory was 164.3 MB in the beginning and 153.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2020-07-20 17:41:41,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-20 17:41:41,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2020-07-20 17:41:41,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((1 == N_COL && 0 == j) && 1 == N_LIN) && (\exists main_~k~0 : int :: (main_~k~0 % 4294967296 < 1 && main_~k~0 % 4294967296 <= 2147483647) && unknown-#memory_int-unknown[matriz][main_~k~0 % 4294967296 * 4 + matriz] <= maior)) || (((0 == k && 1 == N_COL) && 0 == j) && 1 == N_LIN) - InvariantResult [Line: 19]: Loop Invariant [2020-07-20 17:41:41,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-20 17:41:41,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((unknown-#memory_int-unknown[matriz][matriz] < maior + 1 && 1 == N_COL) && 1 == j) && 1 == N_LIN) || ((1 == N_COL && 0 == j) && 1 == N_LIN) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 37.0s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 88 SDtfs, 64 SDslu, 202 SDs, 0 SdLazy, 222 SolverSat, 19 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 121 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 19 NumberOfFragments, 116 HoareAnnotationTreeSize, 13 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 155 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 99 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 150 ConstructedInterpolants, 15 QuantifiedInterpolants, 20610 SizeOfPredicates, 36 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 23/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...