/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 11:37:37,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 11:37:37,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 11:37:37,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 11:37:37,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 11:37:37,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 11:37:37,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 11:37:37,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 11:37:37,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 11:37:37,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 11:37:37,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 11:37:37,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 11:37:37,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 11:37:37,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 11:37:37,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 11:37:37,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 11:37:37,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 11:37:37,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 11:37:37,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 11:37:37,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 11:37:37,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 11:37:37,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 11:37:37,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 11:37:37,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 11:37:37,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 11:37:37,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 11:37:37,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 11:37:37,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 11:37:37,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 11:37:37,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 11:37:37,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 11:37:37,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 11:37:37,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 11:37:37,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 11:37:37,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 11:37:37,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 11:37:37,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 11:37:37,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 11:37:37,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 11:37:37,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 11:37:37,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 11:37:37,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 11:37:37,894 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 11:37:37,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 11:37:37,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 11:37:37,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 11:37:37,896 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 11:37:37,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 11:37:37,897 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 11:37:37,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 11:37:37,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 11:37:37,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 11:37:37,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 11:37:37,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 11:37:37,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 11:37:37,898 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 11:37:37,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 11:37:37,899 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 11:37:37,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 11:37:37,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 11:37:37,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 11:37:37,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 11:37:37,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 11:37:37,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 11:37:37,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 11:37:37,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 11:37:37,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 11:37:37,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 11:37:37,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:37,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 11:37:37,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 11:37:37,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-21 11:37:38,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 11:37:38,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 11:37:38,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 11:37:38,236 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 11:37:38,237 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 11:37:38,240 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-21 11:37:38,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b38b8fa/8579af88f47041f9aae1b9cf2679c401/FLAGadd4a6a32 [2020-07-21 11:37:38,866 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 11:37:38,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-21 11:37:38,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b38b8fa/8579af88f47041f9aae1b9cf2679c401/FLAGadd4a6a32 [2020-07-21 11:37:39,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b38b8fa/8579af88f47041f9aae1b9cf2679c401 [2020-07-21 11:37:39,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 11:37:39,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 11:37:39,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 11:37:39,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 11:37:39,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 11:37:39,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7f1b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39, skipping insertion in model container [2020-07-21 11:37:39,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 11:37:39,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 11:37:39,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 11:37:39,562 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 11:37:39,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 11:37:39,611 INFO L208 MainTranslator]: Completed translation [2020-07-21 11:37:39,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39 WrapperNode [2020-07-21 11:37:39,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 11:37:39,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 11:37:39,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 11:37:39,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 11:37:39,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... [2020-07-21 11:37:39,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 11:37:39,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 11:37:39,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 11:37:39,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 11:37:39,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 11:37:39,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 11:37:39,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 11:37:39,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 11:37:39,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 11:37:39,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 11:37:39,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 11:37:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 11:37:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 11:37:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 11:37:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 11:37:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-21 11:37:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 11:37:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-21 11:37:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-21 11:37:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-21 11:37:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 11:37:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 11:37:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 11:37:40,135 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 11:37:40,136 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-21 11:37:40,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:40 BoogieIcfgContainer [2020-07-21 11:37:40,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 11:37:40,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 11:37:40,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 11:37:40,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 11:37:40,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:37:39" (1/3) ... [2020-07-21 11:37:40,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19379de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:40, skipping insertion in model container [2020-07-21 11:37:40,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:39" (2/3) ... [2020-07-21 11:37:40,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19379de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:40, skipping insertion in model container [2020-07-21 11:37:40,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:40" (3/3) ... [2020-07-21 11:37:40,154 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5f.c [2020-07-21 11:37:40,165 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 11:37:40,173 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 11:37:40,185 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 11:37:40,208 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 11:37:40,209 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 11:37:40,209 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 11:37:40,209 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 11:37:40,209 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 11:37:40,209 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 11:37:40,209 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 11:37:40,209 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 11:37:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-21 11:37:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 11:37:40,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:40,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:37:40,232 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-21 11:37:40,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:40,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1747953082] [2020-07-21 11:37:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:40,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 11:37:40,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:40,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:37:40,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1747953082] [2020-07-21 11:37:40,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:37:40,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 11:37:40,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675690091] [2020-07-21 11:37:40,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 11:37:40,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 11:37:40,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 11:37:40,411 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-21 11:37:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:40,434 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-21 11:37:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 11:37:40,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-21 11:37:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:40,443 INFO L225 Difference]: With dead ends: 58 [2020-07-21 11:37:40,443 INFO L226 Difference]: Without dead ends: 29 [2020-07-21 11:37:40,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 11:37:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-21 11:37:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-21 11:37:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-21 11:37:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-21 11:37:40,482 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-21 11:37:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:40,482 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-21 11:37:40,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 11:37:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-21 11:37:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 11:37:40,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:40,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:37:40,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:40,691 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-21 11:37:40,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:40,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985266678] [2020-07-21 11:37:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:40,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 11:37:40,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:40,861 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-07-21 11:37:40,862 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 11:37:40,863 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:40,871 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:40,874 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-21 11:37:40,874 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:15 [2020-07-21 11:37:40,925 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:40,926 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-21 11:37:40,929 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 11:37:40,942 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-21 11:37:40,943 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:37:40,943 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-21 11:37:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:40,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:37:40,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985266678] [2020-07-21 11:37:40,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:37:40,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-21 11:37:40,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356089551] [2020-07-21 11:37:40,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 11:37:40,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:40,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 11:37:40,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-21 11:37:40,982 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-21 11:37:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:41,112 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-21 11:37:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 11:37:41,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-21 11:37:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:41,116 INFO L225 Difference]: With dead ends: 47 [2020-07-21 11:37:41,117 INFO L226 Difference]: Without dead ends: 45 [2020-07-21 11:37:41,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-21 11:37:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-21 11:37:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-21 11:37:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 11:37:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-21 11:37:41,133 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-21 11:37:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:41,133 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-21 11:37:41,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 11:37:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-21 11:37:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 11:37:41,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:41,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:37:41,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:41,349 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:41,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-21 11:37:41,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:41,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323018723] [2020-07-21 11:37:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:41,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 11:37:41,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:41,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:37:41,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323018723] [2020-07-21 11:37:41,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:37:41,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 11:37:41,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156015210] [2020-07-21 11:37:41,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 11:37:41,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:41,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 11:37:41,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 11:37:41,438 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-21 11:37:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:41,557 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-21 11:37:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 11:37:41,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-21 11:37:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:41,563 INFO L225 Difference]: With dead ends: 71 [2020-07-21 11:37:41,563 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 11:37:41,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-21 11:37:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 11:37:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-21 11:37:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 11:37:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-21 11:37:41,573 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-21 11:37:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:41,573 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-21 11:37:41,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 11:37:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-21 11:37:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 11:37:41,575 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:41,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:37:41,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:41,791 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-21 11:37:41,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:41,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1543770010] [2020-07-21 11:37:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:41,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 11:37:41,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:41,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:37:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:41,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1543770010] [2020-07-21 11:37:41,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:37:41,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 11:37:41,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021374572] [2020-07-21 11:37:41,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 11:37:41,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 11:37:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 11:37:41,924 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-21 11:37:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:37:42,088 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-21 11:37:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 11:37:42,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-21 11:37:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:37:42,090 INFO L225 Difference]: With dead ends: 66 [2020-07-21 11:37:42,090 INFO L226 Difference]: Without dead ends: 55 [2020-07-21 11:37:42,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-21 11:37:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-21 11:37:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-21 11:37:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-21 11:37:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-21 11:37:42,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-21 11:37:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:37:42,112 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-21 11:37:42,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 11:37:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-21 11:37:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 11:37:42,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:37:42,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:37:42,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:42,319 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:37:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:37:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-21 11:37:42,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:37:42,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644609829] [2020-07-21 11:37:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:37:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:37:42,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 11:37:42,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:37:42,396 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-21 11:37:42,397 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:42,403 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:42,410 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 11:37:42,410 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:42,416 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:42,416 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:37:42,417 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 11:37:42,471 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 11:37:42,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-21 11:37:42,473 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:42,503 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 11:37:42,505 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:42,509 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 11:37:42,509 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 11:37:42,510 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:42,537 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:42,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:42,594 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:42,664 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-21 11:37:42,665 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:42,680 INFO L440 ElimStorePlain]: Different costs {12=[v_prenex_2], 20=[|v_#memory_int_16|]} [2020-07-21 11:37:42,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:42,693 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-21 11:37:42,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-21 11:37:42,696 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:42,745 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:37:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:42,774 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-21 11:37:42,775 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-21 11:37:42,778 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:42,850 INFO L624 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2020-07-21 11:37:42,855 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-21 11:37:42,856 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:115 [2020-07-21 11:37:43,982 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-21 11:37:45,114 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-21 11:37:45,118 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:45,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:45,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:37:45,159 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:37:45,164 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:37:45,170 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-21 11:37:45,170 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 17 [2020-07-21 11:37:45,172 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:45,255 INFO L350 Elim1Store]: treesize reduction 27, result has 65.8 percent of original size [2020-07-21 11:37:45,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 73 [2020-07-21 11:37:45,258 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:37:45,259 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:37:45,260 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:37:45,304 INFO L624 ElimStorePlain]: treesize reduction 38, result has 37.7 percent of original size [2020-07-21 11:37:45,305 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:37:45,306 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:7 [2020-07-21 11:37:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:45,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:37:45,423 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:37:55,400 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 11:37:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:37:55,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644609829] [2020-07-21 11:37:55,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:37:55,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-21 11:37:55,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965319322] [2020-07-21 11:37:55,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 11:37:55,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:37:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 11:37:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=165, Unknown=4, NotChecked=0, Total=210 [2020-07-21 11:37:55,429 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2020-07-21 11:38:04,052 WARN L193 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-07-21 11:38:25,507 WARN L193 SmtUtils]: Spent 19.29 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-07-21 11:38:44,641 WARN L193 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2020-07-21 11:38:49,092 WARN L193 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2020-07-21 11:38:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:38:52,468 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2020-07-21 11:38:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-21 11:38:52,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2020-07-21 11:38:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:38:52,476 INFO L225 Difference]: With dead ends: 101 [2020-07-21 11:38:52,476 INFO L226 Difference]: Without dead ends: 99 [2020-07-21 11:38:52,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=166, Invalid=697, Unknown=7, NotChecked=0, Total=870 [2020-07-21 11:38:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-21 11:38:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2020-07-21 11:38:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 11:38:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-07-21 11:38:52,492 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 26 [2020-07-21 11:38:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:38:52,493 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-07-21 11:38:52,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 11:38:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-07-21 11:38:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 11:38:52,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:38:52,494 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:38:52,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:52,709 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:38:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:38:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-21 11:38:52,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:38:52,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2137518177] [2020-07-21 11:38:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:38:52,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 11:38:52,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:38:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:38:52,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 11:38:52,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2137518177] [2020-07-21 11:38:52,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 11:38:52,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 11:38:52,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19299926] [2020-07-21 11:38:52,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 11:38:52,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:38:52,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 11:38:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 11:38:52,800 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 6 states. [2020-07-21 11:38:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:38:52,961 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2020-07-21 11:38:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 11:38:52,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-21 11:38:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:38:52,963 INFO L225 Difference]: With dead ends: 80 [2020-07-21 11:38:52,963 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 11:38:52,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-21 11:38:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 11:38:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2020-07-21 11:38:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 11:38:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-07-21 11:38:52,974 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2020-07-21 11:38:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:38:52,974 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-07-21 11:38:52,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 11:38:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-21 11:38:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 11:38:52,976 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:38:52,976 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:38:53,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:53,192 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:38:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:38:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2074868861, now seen corresponding path program 2 times [2020-07-21 11:38:53,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:38:53,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340773114] [2020-07-21 11:38:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:38:53,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 11:38:53,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:38:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 11:38:53,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:38:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 11:38:53,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340773114] [2020-07-21 11:38:53,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:38:53,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-21 11:38:53,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380234944] [2020-07-21 11:38:53,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 11:38:53,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:38:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 11:38:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-21 11:38:53,370 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 9 states. [2020-07-21 11:38:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:38:53,665 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2020-07-21 11:38:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 11:38:53,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-21 11:38:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:38:53,666 INFO L225 Difference]: With dead ends: 98 [2020-07-21 11:38:53,667 INFO L226 Difference]: Without dead ends: 76 [2020-07-21 11:38:53,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 11:38:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-21 11:38:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-07-21 11:38:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-21 11:38:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-07-21 11:38:53,679 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 30 [2020-07-21 11:38:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:38:53,679 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-07-21 11:38:53,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 11:38:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-21 11:38:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 11:38:53,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:38:53,681 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:38:53,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:53,896 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:38:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:38:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-21 11:38:53,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:38:53,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249817813] [2020-07-21 11:38:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:38:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:38:53,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-21 11:38:53,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:38:53,961 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-21 11:38:53,962 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:53,968 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:53,975 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 11:38:53,976 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:53,982 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:53,983 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:38:53,983 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 11:38:54,075 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 11:38:54,076 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-21 11:38:54,078 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:54,149 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 11:38:54,150 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:54,151 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 11:38:54,152 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 11:38:54,153 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:54,217 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:54,271 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:54,273 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:54,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:54,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:54,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:54,445 INFO L244 Elim1Store]: Index analysis took 134 ms [2020-07-21 11:38:54,510 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:54,511 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2020-07-21 11:38:54,512 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:38:54,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:38:54,514 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:38:54,514 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:38:54,515 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:38:54,515 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:54,517 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:54,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:54,836 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-21 11:38:54,837 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-21 11:38:54,837 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2020-07-21 11:38:54,841 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-21 11:38:54,841 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 11:38:54,843 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 11:38:54,843 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 11:38:54,844 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:38:54,844 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:38:54,845 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:38:54,845 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:38:54,846 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:38:54,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:54,849 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:55,244 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 45 [2020-07-21 11:38:55,245 INFO L624 ElimStorePlain]: treesize reduction 801, result has 14.5 percent of original size [2020-07-21 11:38:55,247 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:55,248 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-21 11:38:55,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-21 11:38:55,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:55,410 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-21 11:38:55,413 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:55,578 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:55,697 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:38:55,967 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-21 11:38:55,969 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:38:55,994 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:55,995 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:55,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:56,000 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:56,022 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:56,056 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-21 11:38:56,057 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2020-07-21 11:38:56,059 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:56,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:56,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:56,092 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:56,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:56,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:56,139 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:56,196 INFO L244 Elim1Store]: Index analysis took 113 ms [2020-07-21 11:38:56,201 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2020-07-21 11:38:56,203 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:56,222 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:56,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:56,224 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:38:56,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:56,229 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2020-07-21 11:38:56,231 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:56,495 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-07-21 11:38:56,496 INFO L624 ElimStorePlain]: treesize reduction 53, result has 80.9 percent of original size [2020-07-21 11:38:56,497 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-07-21 11:38:56,497 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:225 [2020-07-21 11:38:56,782 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-07-21 11:38:56,784 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-21 11:38:56,784 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:38:57,030 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-07-21 11:38:57,032 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:38:57,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,299 INFO L244 Elim1Store]: Index analysis took 212 ms [2020-07-21 11:38:57,401 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-21 11:38:57,401 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 173 [2020-07-21 11:38:57,403 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:57,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,710 INFO L244 Elim1Store]: Index analysis took 275 ms [2020-07-21 11:38:57,727 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:57,727 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 100 [2020-07-21 11:38:57,729 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:57,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:38:57,796 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 11:38:57,797 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 109 [2020-07-21 11:38:57,799 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 11:38:58,138 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2020-07-21 11:38:58,139 INFO L624 ElimStorePlain]: treesize reduction 198, result has 54.9 percent of original size [2020-07-21 11:38:58,146 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-07-21 11:38:58,146 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:275, output treesize:241 [2020-07-21 11:39:16,921 WARN L193 SmtUtils]: Spent 12.35 s on a formula simplification that was a NOOP. DAG size: 100 [2020-07-21 11:39:32,027 WARN L193 SmtUtils]: Spent 14.56 s on a formula simplification that was a NOOP. DAG size: 103 [2020-07-21 11:39:32,030 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,095 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:39:32,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,117 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:39:32,210 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-21 11:39:32,211 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 65 [2020-07-21 11:39:32,213 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,214 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,217 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 11:39:32,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,244 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:39:32,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,259 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:39:32,445 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-21 11:39:32,446 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-21 11:39:32,446 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 80 [2020-07-21 11:39:32,448 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,448 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,449 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,450 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,450 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,451 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,451 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,453 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,454 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,458 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,459 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,464 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,464 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,468 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,469 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,469 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,470 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,470 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,471 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,471 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,472 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,473 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,473 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,474 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,479 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,479 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,482 INFO L544 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 11:39:32,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,533 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 11:39:32,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 11:39:32,696 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-21 11:39:32,697 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-21 11:39:32,697 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 111 [2020-07-21 11:39:32,699 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:39:32,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:39:32,701 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,701 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,702 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,702 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,703 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,704 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,704 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,704 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,706 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,706 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,706 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,707 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,708 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,709 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,711 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,712 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,712 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,714 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,714 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,716 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,716 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,717 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,724 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,725 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,725 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,726 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,727 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,727 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,728 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,728 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,730 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,730 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,730 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,731 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,731 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,733 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,733 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,735 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,735 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,736 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,736 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,737 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,737 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,738 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,738 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,748 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 11:39:32,748 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 11:39:32,749 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,749 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,750 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,750 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,751 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,752 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,753 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,753 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,753 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,755 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,756 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,757 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,757 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,758 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,759 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,759 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,760 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,761 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,761 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,762 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,763 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,764 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,764 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,764 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,765 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,767 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,767 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,767 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,768 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,768 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,769 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,769 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,771 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,772 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,772 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,773 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,773 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,774 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,774 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-21 11:39:32,775 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,777 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 11:39:32,777 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 11:39:32,778 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 11:39:32,778 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 11:39:32,779 INFO L544 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-21 11:39:33,179 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 74 [2020-07-21 11:39:33,180 INFO L624 ElimStorePlain]: treesize reduction 96, result has 60.2 percent of original size [2020-07-21 11:39:33,193 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 11:39:33,194 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:283, output treesize:7 [2020-07-21 11:39:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:39:33,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:39:33,526 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:39:38,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:40,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:42,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base))) (store .cse2 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse2 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:44,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse4 (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (* main_~i~0 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse4 c_main_~a~0.offset) (select .cse3 c_main_~b~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:46,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= 1 (select (let ((.cse4 (let ((.cse5 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 10)))) (.cse6 (* v_subst_2 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse4))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base))) (store .cse3 (+ c_main_~b~0.offset 8) (+ (select .cse3 c_main_~b~0.offset) (select .cse4 c_main_~a~0.offset))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)) (< v_main_~i~0_42 2))) is different from false [2020-07-21 11:39:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-07-21 11:39:46,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249817813] [2020-07-21 11:39:46,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:39:46,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-21 11:39:46,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105537714] [2020-07-21 11:39:46,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 11:39:46,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:39:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 11:39:46,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=224, Unknown=8, NotChecked=170, Total=462 [2020-07-21 11:39:46,601 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 22 states. [2020-07-21 11:39:50,699 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 c_main_~b~0.offset) 1) (= 1 (select .cse1 c_main_~a~0.offset)) (forall ((main_~i~0 Int) (v_subst_2 Int) (v_main_~i~0_42 Int)) (or (= 1 (select (let ((.cse6 (let ((.cse7 (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base)) (.cse10 (* main_~i~0 8))) (store .cse9 (+ .cse10 c_main_~a~0.offset) (+ (select .cse9 (+ .cse10 c_main_~a~0.offset (- 8))) 10)))) (.cse8 (* v_subst_2 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse5 c_main_~b~0.offset) (select .cse6 c_main_~a~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8))) (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset)) (< v_main_~i~0_42 2))) (not (= c_main_~a~0.base c_main_~b~0.base)) (= 1 (select (let ((.cse11 (* c_main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse11) (+ (select .cse0 (+ c_main_~b~0.offset .cse11 (- 8))) (select .cse1 (+ .cse11 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 11:39:52,760 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 1 (select .cse0 c_main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (let ((.cse1 (* main_~i~0 8))) (= (+ (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8))) 10) (select .cse0 (+ .cse1 c_main_~a~0.offset))))))) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int) (v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~b~0.base))) (store .cse5 (+ c_main_~b~0.offset 8) (+ (select .cse6 c_main_~a~0.offset) (select .cse5 c_main_~b~0.offset))))) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select (select (store .cse4 c_main_~b~0.base .cse2) c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8))) (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8)))))))) c_main_~b~0.offset))))) is different from false [2020-07-21 11:39:54,796 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse1 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse0 (= 1 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) .cse1 (exists ((main_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (* main_~i~0 8))) (= (+ (select .cse2 (+ .cse3 c_main_~a~0.offset (- 8))) 10) (select .cse2 (+ .cse3 c_main_~a~0.offset)))))) (and .cse0 (exists ((v_prenex_6 Int)) (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select .cse4 c_main_~a~0.offset) (+ (select .cse4 (+ c_main_~a~0.offset (- 8))) 10))) (let ((.cse5 (* v_prenex_6 8))) (= (+ (select .cse4 (+ .cse5 c_main_~a~0.offset (- 8))) 10) (select .cse4 (+ .cse5 c_main_~a~0.offset))))))) .cse1))) (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 2) (= 1 (select (let ((.cse6 (let ((.cse8 (select |c_#memory_int| c_main_~b~0.base))) (store .cse8 (+ c_main_~b~0.offset 8) (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse8 c_main_~b~0.offset))))) (.cse7 (* v_main_~i~0_42 8))) (store .cse6 (+ c_main_~b~0.offset .cse7) (+ (select .cse6 (+ c_main_~b~0.offset .cse7 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse6) c_main_~a~0.base) (+ c_main_~a~0.offset .cse7 (- 8)))))) c_main_~b~0.offset))))) is different from false [2020-07-21 11:39:56,964 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8))))))) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse6 (select .cse9 (+ c_main_~a~0.offset (- 8)))) (.cse4 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse7 (select .cse9 c_main_~a~0.offset)) (.cse5 (= 1 c_main_~i~0)) (.cse8 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse4 .cse5 (= (+ .cse6 10) .cse7) .cse8) (and .cse4 .cse5 (= .cse6 (+ (select .cse9 (+ c_main_~a~0.offset (- 16))) 10)) .cse8) (and .cse4 (= 1 .cse7) .cse5 (exists ((v_prenex_7 Int)) (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse11 (* v_prenex_7 8))) (= (select .cse10 (+ .cse11 c_main_~a~0.offset)) (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 10)))) .cse8))))) is different from false [2020-07-21 11:39:59,062 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int)) (or (< v_main_~i~0_42 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_42 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base)) (.cse14 (select |c_#memory_int| c_main_~b~0.base)) (.cse13 (* c_main_~i~0 8))) (let ((.cse12 (select .cse14 (+ c_main_~b~0.offset .cse13 (- 8)))) (.cse9 (select .cse14 (+ c_main_~b~0.offset .cse13))) (.cse8 (select .cse6 (+ .cse13 c_main_~a~0.offset (- 8))))) (let ((.cse2 (= .cse9 (+ .cse8 1))) (.cse3 (= .cse9 (+ .cse12 .cse8))) (.cse5 (select .cse6 (+ c_main_~a~0.offset (- 8)))) (.cse4 (= 1 c_main_~i~0)) (.cse7 (not (= c_main_~a~0.base c_main_~b~0.base)))) (or (and .cse2 .cse3 .cse4 (= .cse5 (+ (select .cse6 (+ c_main_~a~0.offset (- 16))) 10)) .cse7) (and .cse2 .cse3 .cse4 (= (+ .cse5 10) .cse8) .cse7) (and (= .cse9 2) .cse4 (exists ((v_prenex_7 Int)) (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse11 (* v_prenex_7 8))) (= (select .cse10 (+ .cse11 c_main_~a~0.offset)) (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) 10)))) (= 1 .cse8) (= 1 .cse12) .cse7)))))) is different from false [2020-07-21 11:40:18,351 WARN L193 SmtUtils]: Spent 16.38 s on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-07-21 11:40:21,314 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-21 11:40:26,387 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-21 11:40:40,732 WARN L193 SmtUtils]: Spent 13.48 s on a formula simplification. DAG size of input: 133 DAG size of output: 133 [2020-07-21 11:40:56,084 WARN L193 SmtUtils]: Spent 12.86 s on a formula simplification. DAG size of input: 135 DAG size of output: 135 [2020-07-21 11:41:25,060 WARN L193 SmtUtils]: Spent 21.45 s on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2020-07-21 11:41:33,748 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-07-21 11:41:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:41:39,998 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2020-07-21 11:41:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 11:41:40,005 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-07-21 11:41:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:41:40,006 INFO L225 Difference]: With dead ends: 90 [2020-07-21 11:41:40,006 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 11:41:40,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 134.9s TimeCoverageRelationStatistics Valid=129, Invalid=494, Unknown=17, NotChecked=550, Total=1190 [2020-07-21 11:41:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 11:41:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 11:41:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 11:41:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2020-07-21 11:41:40,019 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2020-07-21 11:41:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:41:40,019 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2020-07-21 11:41:40,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 11:41:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2020-07-21 11:41:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-21 11:41:40,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:41:40,021 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:41:40,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:40,225 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:41:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:41:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 4 times [2020-07-21 11:41:40,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:41:40,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492926768] [2020-07-21 11:41:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:41:40,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 11:41:40,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:41:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:41:40,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:41:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 11:41:40,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492926768] [2020-07-21 11:41:40,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:41:40,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-21 11:41:40,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110874077] [2020-07-21 11:41:40,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 11:41:40,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:41:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 11:41:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-21 11:41:40,420 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 12 states. [2020-07-21 11:41:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:41:41,444 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2020-07-21 11:41:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 11:41:41,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-21 11:41:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:41:41,449 INFO L225 Difference]: With dead ends: 113 [2020-07-21 11:41:41,449 INFO L226 Difference]: Without dead ends: 95 [2020-07-21 11:41:41,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2020-07-21 11:41:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-21 11:41:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2020-07-21 11:41:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 11:41:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 11:41:41,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2020-07-21 11:41:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:41:41,490 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 11:41:41,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 11:41:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 11:41:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-21 11:41:41,491 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:41:41,491 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:41:41,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:41,692 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:41:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:41:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-21 11:41:41,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:41:41,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227079121] [2020-07-21 11:41:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 11:41:41,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 11:41:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 11:41:41,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 11:41:41,787 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 11:41:41,787 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 11:41:41,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:41:42,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:41:42 BoogieIcfgContainer [2020-07-21 11:41:42,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 11:41:42,047 INFO L168 Benchmark]: Toolchain (without parser) took 242825.30 ms. Allocated memory was 141.6 MB in the beginning and 320.3 MB in the end (delta: 178.8 MB). Free memory was 99.0 MB in the beginning and 78.2 MB in the end (delta: 20.8 MB). Peak memory consumption was 199.6 MB. Max. memory is 7.1 GB. [2020-07-21 11:41:42,047 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 141.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-21 11:41:42,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.47 ms. Allocated memory is still 141.6 MB. Free memory was 98.6 MB in the beginning and 88.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-21 11:41:42,057 INFO L168 Benchmark]: Boogie Preprocessor took 140.93 ms. Allocated memory was 141.6 MB in the beginning and 198.2 MB in the end (delta: 56.6 MB). Free memory was 88.2 MB in the beginning and 176.1 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-21 11:41:42,058 INFO L168 Benchmark]: RCFGBuilder took 385.49 ms. Allocated memory is still 198.2 MB. Free memory was 175.4 MB in the beginning and 158.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2020-07-21 11:41:42,058 INFO L168 Benchmark]: TraceAbstraction took 241904.04 ms. Allocated memory was 198.2 MB in the beginning and 320.3 MB in the end (delta: 122.2 MB). Free memory was 158.5 MB in the beginning and 78.2 MB in the end (delta: 80.4 MB). Peak memory consumption was 202.5 MB. Max. memory is 7.1 GB. [2020-07-21 11:41:42,060 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.27 ms. Allocated memory is still 141.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.47 ms. Allocated memory is still 141.6 MB. Free memory was 98.6 MB in the beginning and 88.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.93 ms. Allocated memory was 141.6 MB in the beginning and 198.2 MB in the end (delta: 56.6 MB). Free memory was 88.2 MB in the beginning and 176.1 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.49 ms. Allocated memory is still 198.2 MB. Free memory was 175.4 MB in the beginning and 158.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241904.04 ms. Allocated memory was 198.2 MB in the beginning and 320.3 MB in the end (delta: 122.2 MB). Free memory was 158.5 MB in the beginning and 78.2 MB in the end (delta: 80.4 MB). Peak memory consumption was 202.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 1 [L30] b[0] = 1 [L31] i=1 VAL [\old(N)=0, a={-1:0}, b={1:0}, i=1, malloc(sizeof(long long)*N)={1:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L31] COND TRUE i