/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:59:19,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:59:19,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:59:19,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:59:19,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:59:19,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:59:19,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:59:19,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:59:19,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:59:19,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:59:19,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:59:19,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:59:19,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:59:19,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:59:19,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:59:19,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:59:19,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:59:19,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:59:19,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:59:19,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:59:19,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:59:19,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:59:19,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:59:19,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:59:19,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:59:19,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:59:19,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:59:19,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:59:19,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:59:19,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:59:19,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:59:19,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:59:19,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:59:19,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:59:19,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:59:19,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:59:19,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:59:19,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:59:19,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:59:19,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:59:19,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:59:19,871 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 [2019-11-23 21:59:19,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:59:19,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:59:19,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:59:19,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:59:19,899 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:59:19,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:59:19,899 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:59:19,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:59:19,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:59:19,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:59:19,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:59:19,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:59:19,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:59:19,900 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:59:19,901 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:59:19,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:59:19,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:59:19,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:59:19,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:59:19,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:59:19,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:59:19,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:59:19,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:59:19,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:59:19,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:59:19,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:59:19,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:59:19,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:59:19,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:59:19,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:59:20,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:59:20,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:59:20,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:59:20,188 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:59:20,189 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:59:20,189 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-1.i [2019-11-23 21:59:20,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29340bf43/61d08aa6bf904a54a3835c64ce9fba37/FLAGc99cec126 [2019-11-23 21:59:20,778 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:59:20,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-1.i [2019-11-23 21:59:20,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29340bf43/61d08aa6bf904a54a3835c64ce9fba37/FLAGc99cec126 [2019-11-23 21:59:21,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29340bf43/61d08aa6bf904a54a3835c64ce9fba37 [2019-11-23 21:59:21,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:59:21,130 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:59:21,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:59:21,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:59:21,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:59:21,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3651ede2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21, skipping insertion in model container [2019-11-23 21:59:21,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:59:21,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:59:21,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:59:21,666 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:59:21,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:59:21,771 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:59:21,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21 WrapperNode [2019-11-23 21:59:21,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:59:21,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:59:21,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:59:21,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:59:21,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:59:21,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:59:21,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:59:21,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:59:21,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (1/1) ... [2019-11-23 21:59:21,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:59:21,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:59:21,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:59:21,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:59:21,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (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 [2019-11-23 21:59:21,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:59:21,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:59:21,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:59:21,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:59:21,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:59:21,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:59:21,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:59:22,276 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:59:22,276 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-23 21:59:22,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:59:22 BoogieIcfgContainer [2019-11-23 21:59:22,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:59:22,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:59:22,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:59:22,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:59:22,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:59:21" (1/3) ... [2019-11-23 21:59:22,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326fca64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:59:22, skipping insertion in model container [2019-11-23 21:59:22,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:59:21" (2/3) ... [2019-11-23 21:59:22,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326fca64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:59:22, skipping insertion in model container [2019-11-23 21:59:22,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:59:22" (3/3) ... [2019-11-23 21:59:22,286 INFO L109 eAbstractionObserver]: Analyzing ICFG list-1.i [2019-11-23 21:59:22,295 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:59:22,301 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:59:22,311 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:59:22,337 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:59:22,337 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:59:22,337 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:59:22,337 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:59:22,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:59:22,338 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:59:22,338 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:59:22,338 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:59:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-23 21:59:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 21:59:22,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:22,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:22,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1661254537, now seen corresponding path program 1 times [2019-11-23 21:59:22,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:22,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239618470] [2019-11-23 21:59:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:22,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239618470] [2019-11-23 21:59:22,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:22,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:59:22,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295678017] [2019-11-23 21:59:22,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:59:22,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:59:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:59:22,513 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-11-23 21:59:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:22,529 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-11-23 21:59:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:59:22,530 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-23 21:59:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:22,538 INFO L225 Difference]: With dead ends: 46 [2019-11-23 21:59:22,538 INFO L226 Difference]: Without dead ends: 21 [2019-11-23 21:59:22,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:59:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-23 21:59:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-23 21:59:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 21:59:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-23 21:59:22,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-23 21:59:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:22,583 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-23 21:59:22,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:59:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-23 21:59:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:59:22,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:22,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:22,585 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash 57591681, now seen corresponding path program 1 times [2019-11-23 21:59:22,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:22,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201735981] [2019-11-23 21:59:22,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:22,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201735981] [2019-11-23 21:59:22,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:22,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:59:22,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55377359] [2019-11-23 21:59:22,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:59:22,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:59:22,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:59:22,751 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-23 21:59:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:22,890 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-23 21:59:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:59:22,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-23 21:59:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:22,893 INFO L225 Difference]: With dead ends: 46 [2019-11-23 21:59:22,894 INFO L226 Difference]: Without dead ends: 42 [2019-11-23 21:59:22,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:59:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-23 21:59:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-11-23 21:59:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:59:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-23 21:59:22,903 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2019-11-23 21:59:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:22,904 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-23 21:59:22,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:59:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-23 21:59:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:59:22,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:22,905 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:22,906 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:22,906 INFO L82 PathProgramCache]: Analyzing trace with hash -440293124, now seen corresponding path program 1 times [2019-11-23 21:59:22,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:22,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830374083] [2019-11-23 21:59:22,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:23,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830374083] [2019-11-23 21:59:23,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:23,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:59:23,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30631218] [2019-11-23 21:59:23,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:59:23,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:59:23,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:59:23,009 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-11-23 21:59:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:23,151 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-23 21:59:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:59:23,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-23 21:59:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:23,154 INFO L225 Difference]: With dead ends: 48 [2019-11-23 21:59:23,154 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 21:59:23,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:59:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 21:59:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-23 21:59:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:59:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-23 21:59:23,163 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-23 21:59:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:23,163 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-23 21:59:23,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:59:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-23 21:59:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:59:23,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:23,166 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:23,166 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash 584409852, now seen corresponding path program 1 times [2019-11-23 21:59:23,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:23,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727551883] [2019-11-23 21:59:23,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:23,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727551883] [2019-11-23 21:59:23,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:59:23,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:59:23,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935108781] [2019-11-23 21:59:23,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:59:23,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:23,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:59:23,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:59:23,265 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2019-11-23 21:59:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:23,382 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-23 21:59:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:59:23,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-23 21:59:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:23,385 INFO L225 Difference]: With dead ends: 48 [2019-11-23 21:59:23,385 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 21:59:23,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:59:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 21:59:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-11-23 21:59:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 21:59:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-23 21:59:23,395 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2019-11-23 21:59:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:23,395 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-23 21:59:23,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:59:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-23 21:59:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:59:23,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:23,397 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:23,397 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:23,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1573518424, now seen corresponding path program 1 times [2019-11-23 21:59:23,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:23,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926047409] [2019-11-23 21:59:23,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:23,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926047409] [2019-11-23 21:59:23,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259376862] [2019-11-23 21:59:23,562 INFO L94 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:23,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 21:59:23,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:23,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:23,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:23,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:59:23,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:23,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:23,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:23,758 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:23,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:23,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,769 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-23 21:59:23,798 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:23,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:23,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:23,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-23 21:59:23,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:23,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:23,839 INFO L496 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. [2019-11-23 21:59:23,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-23 21:59:23,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:23,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:23,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:23,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:59:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:23,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:23,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 21:59:23,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610505148] [2019-11-23 21:59:23,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:59:23,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:23,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:59:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:59:23,891 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2019-11-23 21:59:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:24,165 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-23 21:59:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:59:24,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:59:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:24,167 INFO L225 Difference]: With dead ends: 50 [2019-11-23 21:59:24,167 INFO L226 Difference]: Without dead ends: 46 [2019-11-23 21:59:24,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:59:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-23 21:59:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-11-23 21:59:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 21:59:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-23 21:59:24,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2019-11-23 21:59:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:24,175 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-23 21:59:24,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:59:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-11-23 21:59:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:59:24,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:24,176 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:24,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:24,381 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:24,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash -710116760, now seen corresponding path program 1 times [2019-11-23 21:59:24,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:24,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009918461] [2019-11-23 21:59:24,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:24,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009918461] [2019-11-23 21:59:24,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687068564] [2019-11-23 21:59:24,519 INFO L94 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:24,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 21:59:24,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:24,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:24,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:24,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:59:24,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:24,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:24,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:24,641 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:24,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:24,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-23 21:59:24,684 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:24,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:24,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:24,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-23 21:59:24,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:24,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:24,724 INFO L496 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. [2019-11-23 21:59:24,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-23 21:59:24,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:24,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:24,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:24,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:59:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:24,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:24,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 21:59:24,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501150487] [2019-11-23 21:59:24,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:59:24,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:24,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:59:24,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:59:24,772 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 10 states. [2019-11-23 21:59:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:25,103 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-11-23 21:59:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:59:25,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-23 21:59:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:25,105 INFO L225 Difference]: With dead ends: 61 [2019-11-23 21:59:25,105 INFO L226 Difference]: Without dead ends: 55 [2019-11-23 21:59:25,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:59:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-23 21:59:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2019-11-23 21:59:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-23 21:59:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-23 21:59:25,111 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2019-11-23 21:59:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:25,112 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-23 21:59:25,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:59:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-23 21:59:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:59:25,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:25,113 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:25,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:25,316 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash -274040989, now seen corresponding path program 1 times [2019-11-23 21:59:25,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:25,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341344882] [2019-11-23 21:59:25,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:25,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341344882] [2019-11-23 21:59:25,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015868541] [2019-11-23 21:59:25,478 INFO L94 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:25,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 21:59:25,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:25,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:25,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:59:25,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:25,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-23 21:59:25,609 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:25,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,632 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:25,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-23 21:59:25,680 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_14|]} [2019-11-23 21:59:25,686 INFO L377 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 29 treesize of output 19 [2019-11-23 21:59:25,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-23 21:59:25,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:25,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:25,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:25,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:25,788 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-23 21:59:25,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-23 21:59:25,800 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,814 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-23 21:59:25,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-23 21:59:25,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:25,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-23 21:59:25,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:59:25,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:25,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:25,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:59:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:25,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:25,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-23 21:59:25,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392157900] [2019-11-23 21:59:25,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:59:25,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:59:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:59:25,974 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2019-11-23 21:59:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:26,324 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-11-23 21:59:26,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:59:26,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-23 21:59:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:26,326 INFO L225 Difference]: With dead ends: 63 [2019-11-23 21:59:26,326 INFO L226 Difference]: Without dead ends: 59 [2019-11-23 21:59:26,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:59:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-23 21:59:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-11-23 21:59:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-23 21:59:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-11-23 21:59:26,334 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2019-11-23 21:59:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:26,334 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-11-23 21:59:26,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:59:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-11-23 21:59:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:59:26,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:26,336 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:26,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:26,539 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:26,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1311709090, now seen corresponding path program 2 times [2019-11-23 21:59:26,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:26,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284027784] [2019-11-23 21:59:26,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:26,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284027784] [2019-11-23 21:59:26,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674649665] [2019-11-23 21:59:26,678 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:26,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:59:26,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:26,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 21:59:26,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:26,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:26,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:26,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:26,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-23 21:59:26,777 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:26,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,793 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:26,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-23 21:59:26,817 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2019-11-23 21:59:26,821 INFO L377 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 23 treesize of output 15 [2019-11-23 21:59:26,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-11-23 21:59:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:26,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:26,890 INFO L567 ElimStorePlain]: treesize reduction 147, result has 29.7 percent of original size [2019-11-23 21:59:26,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-11-23 21:59:26,896 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,906 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-23 21:59:26,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-23 21:59:26,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-23 21:59:26,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-23 21:59:26,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:59:26,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:26,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:26,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:59:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:26,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:26,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-23 21:59:26,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133303924] [2019-11-23 21:59:26,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:59:26,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:59:26,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:59:26,963 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 10 states. [2019-11-23 21:59:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:27,274 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-23 21:59:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:59:27,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-23 21:59:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:27,276 INFO L225 Difference]: With dead ends: 65 [2019-11-23 21:59:27,276 INFO L226 Difference]: Without dead ends: 55 [2019-11-23 21:59:27,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:59:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-23 21:59:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-11-23 21:59:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-23 21:59:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-11-23 21:59:27,282 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2019-11-23 21:59:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:27,282 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-11-23 21:59:27,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:59:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-11-23 21:59:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:59:27,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:27,283 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:27,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:27,487 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash 905043038, now seen corresponding path program 1 times [2019-11-23 21:59:27,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:27,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880278533] [2019-11-23 21:59:27,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:59:27,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880278533] [2019-11-23 21:59:27,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306873014] [2019-11-23 21:59:27,572 INFO L94 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:27,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 21:59:27,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:27,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:27,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:27,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:59:27,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:27,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:27,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:27,658 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:27,658 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:27,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-23 21:59:27,686 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:27,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:27,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:27,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-23 21:59:27,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:27,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:27,735 INFO L496 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. [2019-11-23 21:59:27,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-23 21:59:27,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:27,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:27,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:27,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:59:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:59:27,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:27,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 21:59:27,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403131329] [2019-11-23 21:59:27,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:59:27,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:59:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:59:27,768 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 10 states. [2019-11-23 21:59:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:28,008 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-11-23 21:59:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:59:28,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-23 21:59:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:28,009 INFO L225 Difference]: With dead ends: 63 [2019-11-23 21:59:28,009 INFO L226 Difference]: Without dead ends: 50 [2019-11-23 21:59:28,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:59:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-23 21:59:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2019-11-23 21:59:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-23 21:59:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-23 21:59:28,016 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-11-23 21:59:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:28,016 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-23 21:59:28,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:59:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-11-23 21:59:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:59:28,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:28,017 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:28,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:28,221 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash -719006641, now seen corresponding path program 2 times [2019-11-23 21:59:28,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:28,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529266261] [2019-11-23 21:59:28,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529266261] [2019-11-23 21:59:28,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039464831] [2019-11-23 21:59:28,429 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:28,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:59:28,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:28,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 21:59:28,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:28,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:28,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:28,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:28,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,561 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-23 21:59:28,578 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:28,578 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-23 21:59:28,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:28,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:28,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:59:28,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:59:28,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:28,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-23 21:59:28,759 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:28,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:59:28,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,773 INFO L496 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. [2019-11-23 21:59:28,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-23 21:59:28,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-23 21:59:28,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:28,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-23 21:59:28,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-23 21:59:28,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:28,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:28,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-23 21:59:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:28,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:28,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-23 21:59:28,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24636183] [2019-11-23 21:59:28,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:59:28,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:59:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:59:28,910 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 18 states. [2019-11-23 21:59:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:29,585 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-11-23 21:59:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:59:29,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-23 21:59:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:29,587 INFO L225 Difference]: With dead ends: 82 [2019-11-23 21:59:29,587 INFO L226 Difference]: Without dead ends: 76 [2019-11-23 21:59:29,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:59:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-23 21:59:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2019-11-23 21:59:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 21:59:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-11-23 21:59:29,594 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 24 [2019-11-23 21:59:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:29,594 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-11-23 21:59:29,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:59:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-11-23 21:59:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:59:29,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:29,595 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:29,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:29,807 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1204744990, now seen corresponding path program 1 times [2019-11-23 21:59:29,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:29,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069427928] [2019-11-23 21:59:29,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:29,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069427928] [2019-11-23 21:59:29,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658263935] [2019-11-23 21:59:29,951 INFO L94 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:30,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-23 21:59:30,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:30,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:30,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:59:30,068 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:30,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-23 21:59:30,097 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:30,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,111 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:30,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,124 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-23 21:59:30,146 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_18|]} [2019-11-23 21:59:30,150 INFO L377 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 29 treesize of output 19 [2019-11-23 21:59:30,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-23 21:59:30,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:30,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:30,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:30,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:30,207 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-23 21:59:30,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-23 21:59:30,210 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,215 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-23 21:59:30,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-23 21:59:30,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:30,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-23 21:59:30,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:59:30,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:30,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:30,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:59:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:30,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:30,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-23 21:59:30,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969586790] [2019-11-23 21:59:30,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:59:30,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:30,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:59:30,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:59:30,281 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 14 states. [2019-11-23 21:59:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:30,594 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-11-23 21:59:30,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:59:30,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-23 21:59:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:30,595 INFO L225 Difference]: With dead ends: 73 [2019-11-23 21:59:30,595 INFO L226 Difference]: Without dead ends: 60 [2019-11-23 21:59:30,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:59:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-23 21:59:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2019-11-23 21:59:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 21:59:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-11-23 21:59:30,602 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 24 [2019-11-23 21:59:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:30,602 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-11-23 21:59:30,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:59:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-11-23 21:59:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:59:30,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:30,603 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:30,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:30,811 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:30,812 INFO L82 PathProgramCache]: Analyzing trace with hash -419304689, now seen corresponding path program 1 times [2019-11-23 21:59:30,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:30,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228940398] [2019-11-23 21:59:30,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:31,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228940398] [2019-11-23 21:59:31,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839600451] [2019-11-23 21:59:31,066 INFO L94 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:31,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-23 21:59:31,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:31,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:31,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:31,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:31,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,154 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:31,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-23 21:59:31,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:31,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:31,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-23 21:59:31,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:31,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:31,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-23 21:59:31,299 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:31,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:59:31,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,311 INFO L496 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. [2019-11-23 21:59:31,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-23 21:59:31,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 21:59:31,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,426 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-23 21:59:31,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:31,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-23 21:59:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:31,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:31,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:31,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:31,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-23 21:59:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:31,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:31,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-23 21:59:31,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152342891] [2019-11-23 21:59:31,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:59:31,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:59:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:59:31,646 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 17 states. [2019-11-23 21:59:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:32,482 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-11-23 21:59:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:59:32,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-23 21:59:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:32,483 INFO L225 Difference]: With dead ends: 94 [2019-11-23 21:59:32,483 INFO L226 Difference]: Without dead ends: 88 [2019-11-23 21:59:32,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 21:59:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-23 21:59:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2019-11-23 21:59:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-23 21:59:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-11-23 21:59:32,489 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 24 [2019-11-23 21:59:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:32,489 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-11-23 21:59:32,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:59:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-11-23 21:59:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:59:32,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:32,490 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:32,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:32,691 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash 573028938, now seen corresponding path program 3 times [2019-11-23 21:59:32,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:32,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108514866] [2019-11-23 21:59:32,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:32,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108514866] [2019-11-23 21:59:32,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364529686] [2019-11-23 21:59:32,935 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:32,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 21:59:32,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:32,983 WARN L253 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-23 21:59:32,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:33,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:33,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:33,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:33,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,065 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:59:33,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:59:33,098 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:33,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,120 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:33,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:59:33,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:59:33,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,238 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_21|]} [2019-11-23 21:59:33,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:33,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:33,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-23 21:59:33,277 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:59:33,304 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,319 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:47 [2019-11-23 21:59:33,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:33,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-23 21:59:33,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:33,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 102 [2019-11-23 21:59:33,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,453 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.4 percent of original size [2019-11-23 21:59:33,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 109 [2019-11-23 21:59:33,473 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,514 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-11-23 21:59:33,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,516 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-11-23 21:59:33,557 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|], 5=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_23|]} [2019-11-23 21:59:33,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-11-23 21:59:33,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,610 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-23 21:59:33,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 167 [2019-11-23 21:59:33,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,661 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-23 21:59:33,729 INFO L567 ElimStorePlain]: treesize reduction 707, result has 14.8 percent of original size [2019-11-23 21:59:33,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:33,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 134 [2019-11-23 21:59:33,758 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,771 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-11-23 21:59:33,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,851 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-11-23 21:59:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:33,853 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:33,884 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-23 21:59:33,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:33,900 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:33,912 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-23 21:59:33,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:33,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-23 21:59:33,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,983 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-23 21:59:33,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:33,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-23 21:59:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:33,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:33,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-11-23 21:59:33,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906370250] [2019-11-23 21:59:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 21:59:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 21:59:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:59:33,993 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 19 states. [2019-11-23 21:59:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:34,709 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2019-11-23 21:59:34,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:59:34,709 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-11-23 21:59:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:34,710 INFO L225 Difference]: With dead ends: 81 [2019-11-23 21:59:34,711 INFO L226 Difference]: Without dead ends: 77 [2019-11-23 21:59:34,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-11-23 21:59:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-23 21:59:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-23 21:59:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-23 21:59:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-23 21:59:34,723 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 26 [2019-11-23 21:59:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:34,723 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-23 21:59:34,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 21:59:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-23 21:59:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:59:34,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:34,724 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:34,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:34,928 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1624106954, now seen corresponding path program 1 times [2019-11-23 21:59:34,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:34,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816615749] [2019-11-23 21:59:34,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:35,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816615749] [2019-11-23 21:59:35,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519239808] [2019-11-23 21:59:35,078 INFO L94 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 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:35,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 21:59:35,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:35,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:35,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:35,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:35,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,175 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:35,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-23 21:59:35,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:35,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:35,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-23 21:59:35,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:35,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:35,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-23 21:59:35,267 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:35,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:59:35,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,278 INFO L496 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. [2019-11-23 21:59:35,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-23 21:59:35,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 21:59:35,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,380 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-23 21:59:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:35,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-23 21:59:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:35,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-23 21:59:35,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-23 21:59:35,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:35,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-11-23 21:59:35,513 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:35,538 INFO L567 ElimStorePlain]: treesize reduction 21, result has 44.7 percent of original size [2019-11-23 21:59:35,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-23 21:59:35,539 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2019-11-23 21:59:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:35,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:35,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2019-11-23 21:59:35,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189608605] [2019-11-23 21:59:35,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 21:59:35,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 21:59:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:59:35,579 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 16 states. [2019-11-23 21:59:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:36,816 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2019-11-23 21:59:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:59:36,817 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-23 21:59:36,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:36,818 INFO L225 Difference]: With dead ends: 112 [2019-11-23 21:59:36,818 INFO L226 Difference]: Without dead ends: 100 [2019-11-23 21:59:36,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 21:59:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-23 21:59:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2019-11-23 21:59:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-23 21:59:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2019-11-23 21:59:36,826 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 26 [2019-11-23 21:59:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:36,826 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2019-11-23 21:59:36,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 21:59:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2019-11-23 21:59:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:59:36,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:36,827 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:37,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:37,037 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1646157366, now seen corresponding path program 2 times [2019-11-23 21:59:37,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:37,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835282715] [2019-11-23 21:59:37,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:37,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835282715] [2019-11-23 21:59:37,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789551303] [2019-11-23 21:59:37,284 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:37,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:59:37,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:37,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-23 21:59:37,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:37,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:37,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:37,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:37,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,436 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:59:37,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:59:37,475 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:37,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,501 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:37,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 21:59:37,593 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:59:37,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,632 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_31|]} [2019-11-23 21:59:37,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:37,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:37,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:37,677 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,758 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:59:37,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-23 21:59:37,759 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,789 INFO L567 ElimStorePlain]: treesize reduction 8, result has 82.2 percent of original size [2019-11-23 21:59:37,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,790 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:37 [2019-11-23 21:59:37,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 100 [2019-11-23 21:59:37,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:37,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-23 21:59:37,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 105 [2019-11-23 21:59:37,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:37,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:37,893 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-23 21:59:37,940 INFO L567 ElimStorePlain]: treesize reduction 95, result has 48.6 percent of original size [2019-11-23 21:59:37,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:37,941 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2019-11-23 21:59:37,977 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|, |v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_33|]} [2019-11-23 21:59:37,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:37,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 199 [2019-11-23 21:59:37,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:37,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:38,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:38,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:38,080 INFO L567 ElimStorePlain]: treesize reduction 335, result has 32.7 percent of original size [2019-11-23 21:59:38,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 40 [2019-11-23 21:59:38,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:38,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:38,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:38,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2019-11-23 21:59:38,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:38,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:38,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:38,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:38,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:38,157 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:38,209 INFO L567 ElimStorePlain]: treesize reduction 481, result has 15.5 percent of original size [2019-11-23 21:59:38,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:38,210 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2019-11-23 21:59:38,257 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-23 21:59:38,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2019-11-23 21:59:38,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:38,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:38,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:38,290 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 47 [2019-11-23 21:59:38,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:38,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:38,292 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:38,318 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:59:38,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:38,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2019-11-23 21:59:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:38,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:38,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-11-23 21:59:38,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887696021] [2019-11-23 21:59:38,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 21:59:38,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 21:59:38,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:59:38,385 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand 19 states. [2019-11-23 21:59:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:39,118 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2019-11-23 21:59:39,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:59:39,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-11-23 21:59:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:39,120 INFO L225 Difference]: With dead ends: 102 [2019-11-23 21:59:39,120 INFO L226 Difference]: Without dead ends: 96 [2019-11-23 21:59:39,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-11-23 21:59:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-23 21:59:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2019-11-23 21:59:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-23 21:59:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2019-11-23 21:59:39,128 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 26 [2019-11-23 21:59:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:39,129 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2019-11-23 21:59:39,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 21:59:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2019-11-23 21:59:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 21:59:39,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:39,130 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:39,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:39,334 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash 973671813, now seen corresponding path program 4 times [2019-11-23 21:59:39,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:39,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369676198] [2019-11-23 21:59:39,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:39,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369676198] [2019-11-23 21:59:39,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777466159] [2019-11-23 21:59:39,733 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:39,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:59:39,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:39,796 WARN L253 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-23 21:59:39,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:39,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:39,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:39,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:39,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:39,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:39,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:39,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:39,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:39,876 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:59:39,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:39,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:59:39,916 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:39,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:39,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:39,939 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:39,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:39,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:39,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:39,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 21:59:40,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:59:40,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,051 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:59:40,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-23 21:59:40,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,086 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.7 percent of original size [2019-11-23 21:59:40,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:40,091 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,103 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:33 [2019-11-23 21:59:40,159 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 111 [2019-11-23 21:59:40,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,204 INFO L567 ElimStorePlain]: treesize reduction 26, result has 79.4 percent of original size [2019-11-23 21:59:40,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2019-11-23 21:59:40,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:103 [2019-11-23 21:59:40,263 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_32|]} [2019-11-23 21:59:40,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-23 21:59:40,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 250 [2019-11-23 21:59:40,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:40,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2019-11-23 21:59:40,570 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-11-23 21:59:40,573 INFO L567 ElimStorePlain]: treesize reduction 3956, result has 4.6 percent of original size [2019-11-23 21:59:40,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 201 [2019-11-23 21:59:40,611 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,645 INFO L567 ElimStorePlain]: treesize reduction 100, result has 47.4 percent of original size [2019-11-23 21:59:40,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,646 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-11-23 21:59:40,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,799 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 70 [2019-11-23 21:59:40,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:40,801 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:40,829 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.0 percent of original size [2019-11-23 21:59:40,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2019-11-23 21:59:40,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:40,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:18 [2019-11-23 21:59:40,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,890 INFO L377 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 22 treesize of output 18 [2019-11-23 21:59:40,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:40,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:40,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:59:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:40,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:40,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-11-23 21:59:40,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619573398] [2019-11-23 21:59:40,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 21:59:40,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 21:59:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:59:40,920 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 21 states. [2019-11-23 21:59:41,806 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-23 21:59:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:42,238 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2019-11-23 21:59:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:59:42,238 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-23 21:59:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:42,239 INFO L225 Difference]: With dead ends: 116 [2019-11-23 21:59:42,239 INFO L226 Difference]: Without dead ends: 110 [2019-11-23 21:59:42,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:59:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-23 21:59:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2019-11-23 21:59:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-23 21:59:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-11-23 21:59:42,247 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 28 [2019-11-23 21:59:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:42,248 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-11-23 21:59:42,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 21:59:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-11-23 21:59:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 21:59:42,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:42,249 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:42,449 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:42,450 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:42,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:42,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2035331126, now seen corresponding path program 2 times [2019-11-23 21:59:42,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:42,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698276186] [2019-11-23 21:59:42,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:42,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698276186] [2019-11-23 21:59:42,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189694360] [2019-11-23 21:59:42,656 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:42,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:59:42,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:42,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-23 21:59:42,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:42,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:42,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:42,746 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:42,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,780 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-23 21:59:42,784 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:42,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-23 21:59:42,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:42,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:42,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:59:42,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:59:42,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:42,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-23 21:59:42,973 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:42,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:59:42,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:42,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:42,986 INFO L496 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. [2019-11-23 21:59:42,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-23 21:59:43,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-23 21:59:43,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:43,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:43,036 INFO L496 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. [2019-11-23 21:59:43,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-23 21:59:43,084 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:43,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-23 21:59:43,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:43,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:43,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:43,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-11-23 21:59:43,197 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:43,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-11-23 21:59:43,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:43,262 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-23 21:59:43,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:43,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-11-23 21:59:43,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:43,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-23 21:59:43,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:43,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:43,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:43,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-23 21:59:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:43,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:43,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-11-23 21:59:43,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325730614] [2019-11-23 21:59:43,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 21:59:43,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 21:59:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:59:43,536 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 23 states. [2019-11-23 21:59:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:44,545 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2019-11-23 21:59:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:59:44,545 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2019-11-23 21:59:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:44,546 INFO L225 Difference]: With dead ends: 138 [2019-11-23 21:59:44,546 INFO L226 Difference]: Without dead ends: 130 [2019-11-23 21:59:44,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 21:59:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-23 21:59:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2019-11-23 21:59:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-23 21:59:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-11-23 21:59:44,565 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 28 [2019-11-23 21:59:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:44,565 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-11-23 21:59:44,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 21:59:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-11-23 21:59:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:59:44,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:44,566 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:44,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:44,770 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash -555581952, now seen corresponding path program 5 times [2019-11-23 21:59:44,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:44,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526495502] [2019-11-23 21:59:44,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:45,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526495502] [2019-11-23 21:59:45,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247785942] [2019-11-23 21:59:45,107 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:45,161 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-23 21:59:45,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:45,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-23 21:59:45,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:45,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:45,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:45,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:45,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,226 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:59:45,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:59:45,259 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:45,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,281 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:45,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,299 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 21:59:45,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:59:45,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:45,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:45,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,415 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:59:45,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-23 21:59:45,416 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,445 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-11-23 21:59:45,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,445 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:33 [2019-11-23 21:59:45,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2019-11-23 21:59:45,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 107 [2019-11-23 21:59:45,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:45,525 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,562 INFO L567 ElimStorePlain]: treesize reduction 26, result has 78.0 percent of original size [2019-11-23 21:59:45,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:103 [2019-11-23 21:59:45,606 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 6=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_43|]} [2019-11-23 21:59:45,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-23 21:59:45,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 263 treesize of output 246 [2019-11-23 21:59:45,692 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,753 INFO L567 ElimStorePlain]: treesize reduction 100, result has 59.5 percent of original size [2019-11-23 21:59:45,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:45,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 134 [2019-11-23 21:59:45,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:45,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:45,796 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,853 INFO L567 ElimStorePlain]: treesize reduction 218, result has 29.2 percent of original size [2019-11-23 21:59:45,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:45,854 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-11-23 21:59:46,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:46,089 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 70 [2019-11-23 21:59:46,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:46,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:46,092 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:46,120 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.0 percent of original size [2019-11-23 21:59:46,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2019-11-23 21:59:46,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:46,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:46,131 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:18 [2019-11-23 21:59:46,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:46,174 INFO L377 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 22 treesize of output 18 [2019-11-23 21:59:46,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,186 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-23 21:59:46,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:46,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:59:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:46,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:46,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-11-23 21:59:46,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198051115] [2019-11-23 21:59:46,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 21:59:46,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 21:59:46,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:59:46,195 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 21 states. [2019-11-23 21:59:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:47,304 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2019-11-23 21:59:47,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:59:47,304 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-11-23 21:59:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:47,305 INFO L225 Difference]: With dead ends: 112 [2019-11-23 21:59:47,305 INFO L226 Difference]: Without dead ends: 92 [2019-11-23 21:59:47,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=924, Unknown=1, NotChecked=0, Total=1056 [2019-11-23 21:59:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-23 21:59:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2019-11-23 21:59:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 21:59:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2019-11-23 21:59:47,312 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 30 [2019-11-23 21:59:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:47,312 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2019-11-23 21:59:47,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 21:59:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2019-11-23 21:59:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:59:47,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:47,313 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:47,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:47,517 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 464137216, now seen corresponding path program 2 times [2019-11-23 21:59:47,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:47,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222392908] [2019-11-23 21:59:47,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 21:59:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222392908] [2019-11-23 21:59:47,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719704811] [2019-11-23 21:59:47,633 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:47,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:59:47,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:47,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 21:59:47,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:47,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:47,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:47,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 21:59:47,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,725 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:47,725 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-23 21:59:47,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:47,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:47,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-23 21:59:47,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:47,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:59:47,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-23 21:59:47,811 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:59:47,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:59:47,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,822 INFO L496 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. [2019-11-23 21:59:47,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-23 21:59:47,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 21:59:47,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,926 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-23 21:59:47,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:47,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-23 21:59:47,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:47,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-23 21:59:47,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-23 21:59:47,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:47,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:47,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-11-23 21:59:47,995 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:48,015 INFO L567 ElimStorePlain]: treesize reduction 25, result has 40.5 percent of original size [2019-11-23 21:59:48,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-23 21:59:48,016 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2019-11-23 21:59:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 21:59:48,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:48,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2019-11-23 21:59:48,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670463565] [2019-11-23 21:59:48,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:59:48,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:59:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:59:48,022 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 13 states. [2019-11-23 21:59:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:48,540 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2019-11-23 21:59:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:59:48,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-23 21:59:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:48,542 INFO L225 Difference]: With dead ends: 95 [2019-11-23 21:59:48,542 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 21:59:48,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:59:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 21:59:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2019-11-23 21:59:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 21:59:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-11-23 21:59:48,549 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 30 [2019-11-23 21:59:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:48,549 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-11-23 21:59:48,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:59:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-11-23 21:59:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:59:48,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:48,550 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:48,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:48,755 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2095788465, now seen corresponding path program 6 times [2019-11-23 21:59:48,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:48,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260021712] [2019-11-23 21:59:48,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:49,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260021712] [2019-11-23 21:59:49,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943727026] [2019-11-23 21:59:49,106 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:49,171 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-23 21:59:49,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:49,173 WARN L253 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-23 21:59:49,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:49,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:49,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:49,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:49,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,240 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:59:49,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:59:49,249 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:49,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,269 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:49,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:59:49,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:59:49,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,347 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_61|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_40|]} [2019-11-23 21:59:49,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:49,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:49,393 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:59:49,418 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,436 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:47 [2019-11-23 21:59:49,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:49,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 129 [2019-11-23 21:59:49,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,554 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.0 percent of original size [2019-11-23 21:59:49,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:49,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-23 21:59:49,564 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 109 [2019-11-23 21:59:49,608 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,654 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-11-23 21:59:49,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,655 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-11-23 21:59:49,694 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_63|], 5=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_42|]} [2019-11-23 21:59:49,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:49,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 21:59:49,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,788 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 21:59:49,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 74 [2019-11-23 21:59:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,794 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:49,863 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.7 percent of original size [2019-11-23 21:59:49,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:49,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-11-23 21:59:49,874 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:49,897 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:69 [2019-11-23 21:59:49,948 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_int_64|]} [2019-11-23 21:59:49,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:49,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 196 [2019-11-23 21:59:49,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:49,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,070 INFO L567 ElimStorePlain]: treesize reduction 84, result has 75.2 percent of original size [2019-11-23 21:59:50,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 154 [2019-11-23 21:59:50,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 41 [2019-11-23 21:59:50,120 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,162 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:267, output treesize:159 [2019-11-23 21:59:50,216 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_65|], 11=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_50|]} [2019-11-23 21:59:50,250 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 256 [2019-11-23 21:59:50,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,361 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-23 21:59:50,362 INFO L567 ElimStorePlain]: treesize reduction 100, result has 82.6 percent of original size [2019-11-23 21:59:50,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 443 treesize of output 407 [2019-11-23 21:59:50,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,479 INFO L377 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 117 [2019-11-23 21:59:50,480 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,546 INFO L567 ElimStorePlain]: treesize reduction 96, result has 61.6 percent of original size [2019-11-23 21:59:50,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,547 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:436, output treesize:154 [2019-11-23 21:59:50,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 90 [2019-11-23 21:59:50,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 98 [2019-11-23 21:59:50,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,731 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:50,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 94 [2019-11-23 21:59:50,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,775 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:50,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:50,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 94 [2019-11-23 21:59:50,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:50,794 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:50,963 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-23 21:59:50,963 INFO L567 ElimStorePlain]: treesize reduction 52, result has 77.4 percent of original size [2019-11-23 21:59:50,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2019-11-23 21:59:50,974 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:50,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:50,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2019-11-23 21:59:50,988 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:51,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2019-11-23 21:59:51,004 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:51,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:51,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-11-23 21:59:51,053 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:545, output treesize:103 [2019-11-23 21:59:51,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:51,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:51,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-23 21:59:51,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:51,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:51,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:51,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-23 21:59:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:51,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:51,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2019-11-23 21:59:51,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633512777] [2019-11-23 21:59:51,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 21:59:51,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:51,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 21:59:51,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:59:51,314 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 25 states. [2019-11-23 21:59:52,339 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-23 21:59:52,598 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-11-23 21:59:52,795 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-11-23 21:59:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:53,403 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2019-11-23 21:59:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-23 21:59:53,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-11-23 21:59:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:53,404 INFO L225 Difference]: With dead ends: 110 [2019-11-23 21:59:53,405 INFO L226 Difference]: Without dead ends: 102 [2019-11-23 21:59:53,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2019-11-23 21:59:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-23 21:59:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2019-11-23 21:59:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-23 21:59:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-11-23 21:59:53,412 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 30 [2019-11-23 21:59:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:53,412 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-11-23 21:59:53,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 21:59:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-11-23 21:59:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:59:53,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:53,413 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:53,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:53,617 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:53,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:53,618 INFO L82 PathProgramCache]: Analyzing trace with hash 160117440, now seen corresponding path program 1 times [2019-11-23 21:59:53,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:53,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959313419] [2019-11-23 21:59:53,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:59:53,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959313419] [2019-11-23 21:59:53,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140544218] [2019-11-23 21:59:53,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:53,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-23 21:59:53,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:53,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:53,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:53,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:53,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:53,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:59:53,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:53,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:53,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:53,997 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-23 21:59:53,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:53,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-23 21:59:54,022 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:54,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,039 INFO L377 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 13 treesize of output 9 [2019-11-23 21:59:54,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-23 21:59:54,094 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-23 21:59:54,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,118 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_66|], 2=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_52|]} [2019-11-23 21:59:54,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:54,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:54,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:59:54,151 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,202 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:59:54,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2019-11-23 21:59:54,204 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,229 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.2 percent of original size [2019-11-23 21:59:54,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,229 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:38 [2019-11-23 21:59:54,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 118 [2019-11-23 21:59:54,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:54,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2019-11-23 21:59:54,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 125 [2019-11-23 21:59:54,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:54,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,362 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-23 21:59:54,410 INFO L567 ElimStorePlain]: treesize reduction 119, result has 47.3 percent of original size [2019-11-23 21:59:54,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,411 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:176, output treesize:101 [2019-11-23 21:59:54,446 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|, |v_#memory_int_68|], 6=[|v_#memory_$Pointer$.base_54|]} [2019-11-23 21:59:54,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 231 [2019-11-23 21:59:54,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:54,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:54,527 INFO L567 ElimStorePlain]: treesize reduction 411, result has 32.3 percent of original size [2019-11-23 21:59:54,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 48 [2019-11-23 21:59:54,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,602 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 182 [2019-11-23 21:59:54,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:54,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:54,606 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-23 21:59:54,651 INFO L567 ElimStorePlain]: treesize reduction 408, result has 20.5 percent of original size [2019-11-23 21:59:54,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:54,652 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:265, output treesize:105 [2019-11-23 21:59:54,691 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-23 21:59:54,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 74 [2019-11-23 21:59:54,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,716 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 49 [2019-11-23 21:59:54,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:54,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:54,718 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:54,738 INFO L567 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2019-11-23 21:59:54,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:54,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:123, output treesize:19 [2019-11-23 21:59:54,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:59:54,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:54,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:54,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:59:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:59:54,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:54,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-23 21:59:54,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147367808] [2019-11-23 21:59:54,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:59:54,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:59:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:59:54,778 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 20 states. [2019-11-23 21:59:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:55,570 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2019-11-23 21:59:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:59:55,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-23 21:59:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:55,571 INFO L225 Difference]: With dead ends: 108 [2019-11-23 21:59:55,572 INFO L226 Difference]: Without dead ends: 93 [2019-11-23 21:59:55,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:59:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-23 21:59:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2019-11-23 21:59:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-23 21:59:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2019-11-23 21:59:55,579 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 30 [2019-11-23 21:59:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:55,579 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2019-11-23 21:59:55,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:59:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2019-11-23 21:59:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:59:55,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:55,580 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:55,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:55,781 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash 410884480, now seen corresponding path program 3 times [2019-11-23 21:59:55,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:55,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412647696] [2019-11-23 21:59:55,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412647696] [2019-11-23 21:59:56,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612649412] [2019-11-23 21:59:56,148 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:56,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:59:56,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:56,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-23 21:59:56,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:56,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:56,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:56,266 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:56,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,297 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:59:56,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:59:56,325 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:56,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,346 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:56,346 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 21:59:56,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:59:56,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,453 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:59:56,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-23 21:59:56,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,490 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.7 percent of original size [2019-11-23 21:59:56,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:56,494 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,507 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:33 [2019-11-23 21:59:56,557 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 111 [2019-11-23 21:59:56,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:56,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,600 INFO L567 ElimStorePlain]: treesize reduction 26, result has 79.4 percent of original size [2019-11-23 21:59:56,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2019-11-23 21:59:56,604 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:103 [2019-11-23 21:59:56,666 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_69|], 6=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_52|]} [2019-11-23 21:59:56,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-23 21:59:56,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 250 [2019-11-23 21:59:56,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:56,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:56,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:56,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:56,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:56,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:56,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-23 21:59:56,828 INFO L567 ElimStorePlain]: treesize reduction 1546, result has 10.9 percent of original size [2019-11-23 21:59:56,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:56,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 201 [2019-11-23 21:59:56,868 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,901 INFO L567 ElimStorePlain]: treesize reduction 100, result has 47.4 percent of original size [2019-11-23 21:59:56,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:56,902 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-11-23 21:59:57,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:57,036 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 70 [2019-11-23 21:59:57,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:57,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:57,038 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:57,097 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.0 percent of original size [2019-11-23 21:59:57,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2019-11-23 21:59:57,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:57,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:57,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:57,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:18 [2019-11-23 21:59:57,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:57,158 INFO L377 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 22 treesize of output 18 [2019-11-23 21:59:57,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:57,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:57,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:57,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:59:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:57,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:59:57,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-11-23 21:59:57,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939693523] [2019-11-23 21:59:57,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:59:57,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:59:57,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:59:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=406, Unknown=1, NotChecked=0, Total=462 [2019-11-23 21:59:57,197 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 22 states. [2019-11-23 21:59:57,995 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-23 21:59:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:58,211 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2019-11-23 21:59:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 21:59:58,219 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-23 21:59:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:58,220 INFO L225 Difference]: With dead ends: 105 [2019-11-23 21:59:58,220 INFO L226 Difference]: Without dead ends: 90 [2019-11-23 21:59:58,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=810, Unknown=1, NotChecked=0, Total=930 [2019-11-23 21:59:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-23 21:59:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2019-11-23 21:59:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-23 21:59:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-11-23 21:59:58,235 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 30 [2019-11-23 21:59:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:58,235 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-11-23 21:59:58,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:59:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-11-23 21:59:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 21:59:58,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:58,236 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:59:58,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:58,440 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:58,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:58,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1227728591, now seen corresponding path program 2 times [2019-11-23 21:59:58,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:58,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315228996] [2019-11-23 21:59:58,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:58,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315228996] [2019-11-23 21:59:58,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303517687] [2019-11-23 21:59:58,797 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:58,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:59:58,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:58,849 WARN L253 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-23 21:59:58,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:58,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:59:58,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:58,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:58,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:58,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:58,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,908 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:59:58,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:59:58,915 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:58,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:58,936 INFO L377 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 11 treesize of output 7 [2019-11-23 21:59:58,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:58,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:59:58,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:58,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:59:58,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:58,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:58,998 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_70|], 2=[|v_#memory_$Pointer$.base_60|, |v_#memory_$Pointer$.offset_54|]} [2019-11-23 21:59:59,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:59:59,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:59:59,033 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:59:59,056 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,072 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2019-11-23 21:59:59,096 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_71|], 3=[|v_#memory_$Pointer$.offset_55|, |v_#memory_$Pointer$.base_61|]} [2019-11-23 21:59:59,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:59,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:59,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 101 [2019-11-23 21:59:59,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,255 INFO L567 ElimStorePlain]: treesize reduction 142, result has 35.2 percent of original size [2019-11-23 21:59:59,261 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:59,266 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:59,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-23 21:59:59,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,288 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,361 INFO L567 ElimStorePlain]: treesize reduction 29, result has 68.5 percent of original size [2019-11-23 21:59:59,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,363 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:83 [2019-11-23 21:59:59,414 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_72|, |v_#memory_$Pointer$.offset_56|], 6=[|v_#memory_$Pointer$.base_62|]} [2019-11-23 21:59:59,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:59,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 21:59:59,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,491 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:59:59,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 75 [2019-11-23 21:59:59,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,551 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-11-23 21:59:59,602 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 21:59:59,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 60 [2019-11-23 21:59:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,606 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:59,648 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-23 21:59:59,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,649 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:55 [2019-11-23 21:59:59,694 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_57|], 5=[|v_#memory_$Pointer$.base_63|], 6=[|v_#memory_int_73|]} [2019-11-23 21:59:59,702 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-23 21:59:59,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,760 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 153 [2019-11-23 21:59:59,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:59:59,862 INFO L567 ElimStorePlain]: treesize reduction 1342, result has 10.6 percent of original size [2019-11-23 21:59:59,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:59,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 33 [2019-11-23 21:59:59,869 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:59,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:59,889 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-23 21:59:59,941 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_64|], 6=[|v_#memory_$Pointer$.offset_58|, |v_#memory_int_74|]} [2019-11-23 21:59:59,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:59,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-23 21:59:59,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:59,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:59,998 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:00,080 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-11-23 22:00:00,120 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:00,121 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 110 [2019-11-23 22:00:00,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:00,191 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-23 22:00:00,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:00,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 22:00:00,242 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:00,328 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-11-23 22:00:00,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:00,330 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-11-23 22:00:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,622 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-23 22:00:00,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:00:00,629 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8], 1=[|#memory_$Pointer$.base|, v_prenex_10, v_prenex_11, v_prenex_15, v_prenex_7], 2=[|#memory_$Pointer$.offset|, v_prenex_16]} [2019-11-23 22:00:00,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2019-11-23 22:00:00,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:00,809 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2019-11-23 22:00:00,809 INFO L567 ElimStorePlain]: treesize reduction 24, result has 93.4 percent of original size [2019-11-23 22:00:00,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:00,823 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 74 [2019-11-23 22:00:00,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:00,825 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:00,993 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2019-11-23 22:00:00,994 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.7 percent of original size [2019-11-23 22:00:01,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:01,007 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2019-11-23 22:00:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:01,009 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:01,194 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2019-11-23 22:00:01,195 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.5 percent of original size [2019-11-23 22:00:01,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:01,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2019-11-23 22:00:01,205 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:01,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:01,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:01,293 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 67 [2019-11-23 22:00:01,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:01,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:01,295 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:01,437 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-11-23 22:00:01,438 INFO L567 ElimStorePlain]: treesize reduction 8, result has 96.3 percent of original size [2019-11-23 22:00:01,448 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:01,449 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2019-11-23 22:00:01,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:01,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:01,450 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:01,595 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-23 22:00:01,595 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.9 percent of original size [2019-11-23 22:00:01,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-11-23 22:00:01,602 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:01,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:01,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2019-11-23 22:00:01,678 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:01,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:01,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-11-23 22:00:01,739 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:372, output treesize:143 [2019-11-23 22:00:01,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:01,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:01,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 21 [2019-11-23 22:00:01,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:01,996 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-23 22:00:01,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:01,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-23 22:00:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:02,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:02,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2019-11-23 22:00:02,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370390704] [2019-11-23 22:00:02,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 22:00:02,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:02,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 22:00:02,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-11-23 22:00:02,006 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 24 states. [2019-11-23 22:00:03,171 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-11-23 22:00:03,581 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-23 22:00:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:03,959 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2019-11-23 22:00:03,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 22:00:03,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-23 22:00:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:03,961 INFO L225 Difference]: With dead ends: 120 [2019-11-23 22:00:03,961 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:00:03,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=272, Invalid=1620, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 22:00:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:00:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2019-11-23 22:00:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-23 22:00:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-23 22:00:03,969 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 30 [2019-11-23 22:00:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:03,969 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-23 22:00:03,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 22:00:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-23 22:00:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:00:03,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:03,970 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:04,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:04,174 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash 354431773, now seen corresponding path program 3 times [2019-11-23 22:00:04,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:04,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838584970] [2019-11-23 22:00:04,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:04,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838584970] [2019-11-23 22:00:04,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372216661] [2019-11-23 22:00:04,406 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:04,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 22:00:04,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:00:04,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-23 22:00:04,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:04,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 22:00:04,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:00:04,540 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-11-23 22:00:04,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,553 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:04,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-23 22:00:04,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:04,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 22:00:04,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-23 22:00:04,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:04,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 22:00:04,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-23 22:00:04,665 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 22:00:04,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 22:00:04,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,674 INFO L496 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. [2019-11-23 22:00:04,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-23 22:00:04,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 22:00:04,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,772 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-11-23 22:00:04,772 INFO L496 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. [2019-11-23 22:00:04,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-23 22:00:04,860 INFO L343 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2019-11-23 22:00:04,860 INFO L377 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 3 case distinctions, treesize of input 37 treesize of output 59 [2019-11-23 22:00:04,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:04,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:04,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:40 [2019-11-23 22:00:04,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:04,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:04,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 22:00:04,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:04,972 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-11-23 22:00:04,973 INFO L496 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. [2019-11-23 22:00:04,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-23 22:00:05,022 INFO L343 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2019-11-23 22:00:05,022 INFO L377 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 3 case distinctions, treesize of input 37 treesize of output 59 [2019-11-23 22:00:05,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:05,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:05,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:05,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:40 [2019-11-23 22:00:05,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,115 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:05,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 22:00:05,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:05,152 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-23 22:00:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:05,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-23 22:00:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:05,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 22:00:05,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:05,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:05,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:05,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-23 22:00:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 22:00:05,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:05,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 23 [2019-11-23 22:00:05,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85826985] [2019-11-23 22:00:05,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 22:00:05,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 22:00:05,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:00:05,382 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 23 states. [2019-11-23 22:00:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:06,004 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-11-23 22:00:06,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:00:06,005 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-11-23 22:00:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:06,006 INFO L225 Difference]: With dead ends: 109 [2019-11-23 22:00:06,006 INFO L226 Difference]: Without dead ends: 105 [2019-11-23 22:00:06,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:00:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-23 22:00:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2019-11-23 22:00:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-23 22:00:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-23 22:00:06,014 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 32 [2019-11-23 22:00:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:06,014 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-23 22:00:06,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 22:00:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-23 22:00:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:00:06,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:06,015 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:06,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:06,220 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1873252844, now seen corresponding path program 3 times [2019-11-23 22:00:06,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:06,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549379191] [2019-11-23 22:00:06,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:06,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549379191] [2019-11-23 22:00:06,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814117029] [2019-11-23 22:00:06,536 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:06,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 22:00:06,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:00:06,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-23 22:00:06,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:06,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 22:00:06,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:00:06,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:06,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,665 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 22:00:06,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 22:00:06,670 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:06,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,695 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:06,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,712 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 22:00:06,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 22:00:06,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,765 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_84|], 2=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_63|]} [2019-11-23 22:00:06,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:00:06,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:06,808 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 22:00:06,830 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,845 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:40 [2019-11-23 22:00:06,869 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_85|], 3=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.offset_64|]} [2019-11-23 22:00:06,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:06,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 22:00:06,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,909 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:00:06,913 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 22:00:06,927 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:06,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-23 22:00:06,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:06,928 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:06,989 INFO L567 ElimStorePlain]: treesize reduction 41, result has 68.9 percent of original size [2019-11-23 22:00:07,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 101 [2019-11-23 22:00:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,016 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,081 INFO L567 ElimStorePlain]: treesize reduction 142, result has 30.7 percent of original size [2019-11-23 22:00:07,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,082 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:61 [2019-11-23 22:00:07,111 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_65|, |v_#memory_int_86|], 5=[|v_#memory_$Pointer$.base_69|]} [2019-11-23 22:00:07,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:07,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:07,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:07,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 22:00:07,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,223 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 22:00:07,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 60 [2019-11-23 22:00:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,227 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:07,271 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-23 22:00:07,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,272 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:55 [2019-11-23 22:00:07,308 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_66|], 5=[|v_#memory_$Pointer$.base_70|], 6=[|v_#memory_int_87|]} [2019-11-23 22:00:07,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-23 22:00:07,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,383 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 153 [2019-11-23 22:00:07,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 22:00:07,488 INFO L567 ElimStorePlain]: treesize reduction 419, result has 27.5 percent of original size [2019-11-23 22:00:07,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:07,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 33 [2019-11-23 22:00:07,493 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:07,515 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-23 22:00:07,562 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_71|], 6=[|v_#memory_int_88|, |v_#memory_$Pointer$.offset_67|]} [2019-11-23 22:00:07,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-23 22:00:07,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:07,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,657 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:07,731 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-11-23 22:00:07,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 86 [2019-11-23 22:00:07,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,861 INFO L567 ElimStorePlain]: treesize reduction 34, result has 77.0 percent of original size [2019-11-23 22:00:07,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:07,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 121 [2019-11-23 22:00:07,904 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:07,981 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.0 percent of original size [2019-11-23 22:00:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:07,985 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-11-23 22:00:07,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:07,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,263 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-23 22:00:08,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:00:08,270 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_21], 1=[|#memory_$Pointer$.base|, v_prenex_20, v_prenex_25, v_prenex_18, v_prenex_17], 2=[|#memory_$Pointer$.offset|, v_prenex_26]} [2019-11-23 22:00:08,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2019-11-23 22:00:08,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:08,450 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2019-11-23 22:00:08,451 INFO L567 ElimStorePlain]: treesize reduction 24, result has 93.4 percent of original size [2019-11-23 22:00:08,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:08,462 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 74 [2019-11-23 22:00:08,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,464 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:08,632 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 116 [2019-11-23 22:00:08,632 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.3 percent of original size [2019-11-23 22:00:08,643 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:08,643 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2019-11-23 22:00:08,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,645 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:08,791 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-11-23 22:00:08,792 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.0 percent of original size [2019-11-23 22:00:08,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:08,803 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 67 [2019-11-23 22:00:08,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:08,805 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:08,944 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-23 22:00:08,945 INFO L567 ElimStorePlain]: treesize reduction 8, result has 96.4 percent of original size [2019-11-23 22:00:08,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:08,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2019-11-23 22:00:08,953 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:09,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:09,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:09,033 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-11-23 22:00:09,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:09,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:09,034 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:09,158 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-11-23 22:00:09,158 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.5 percent of original size [2019-11-23 22:00:09,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2019-11-23 22:00:09,165 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:09,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:09,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2019-11-23 22:00:09,232 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:09,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:09,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-11-23 22:00:09,288 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:372, output treesize:131 [2019-11-23 22:00:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:09,385 INFO L392 ElimStorePlain]: Different costs {3=[v_prenex_28], 5=[|#memory_int|]} [2019-11-23 22:00:09,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:09,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2019-11-23 22:00:09,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:09,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:09,428 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:09,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 29 [2019-11-23 22:00:09,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:09,462 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-11-23 22:00:09,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-23 22:00:09,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:67, output treesize:7 [2019-11-23 22:00:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:09,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:09,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2019-11-23 22:00:09,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804470205] [2019-11-23 22:00:09,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 22:00:09,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 22:00:09,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:00:09,474 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 20 states. [2019-11-23 22:00:10,385 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-11-23 22:00:10,694 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-23 22:00:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:10,821 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-11-23 22:00:10,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 22:00:10,823 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-11-23 22:00:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:10,824 INFO L225 Difference]: With dead ends: 109 [2019-11-23 22:00:10,824 INFO L226 Difference]: Without dead ends: 101 [2019-11-23 22:00:10,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:00:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-23 22:00:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2019-11-23 22:00:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-23 22:00:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-23 22:00:10,832 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 32 [2019-11-23 22:00:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:10,832 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-23 22:00:10,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 22:00:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-11-23 22:00:10,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:00:10,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:10,833 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:11,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:11,042 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1317506732, now seen corresponding path program 1 times [2019-11-23 22:00:11,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:11,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601128609] [2019-11-23 22:00:11,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:11,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601128609] [2019-11-23 22:00:11,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875686593] [2019-11-23 22:00:11,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:11,473 WARN L253 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-23 22:00:11,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:11,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 22:00:11,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:00:11,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:11,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,534 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 22:00:11,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 22:00:11,571 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:11,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,593 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:11,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,610 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 22:00:11,678 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 22:00:11,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,763 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.0 percent of original size [2019-11-23 22:00:11,764 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_89|], 2=[|v_#memory_$Pointer$.offset_69|, |v_#memory_$Pointer$.base_73|]} [2019-11-23 22:00:11,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:00:11,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:11,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:11,805 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,859 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 22:00:11,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2019-11-23 22:00:11,860 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,904 INFO L567 ElimStorePlain]: treesize reduction 8, result has 86.7 percent of original size [2019-11-23 22:00:11,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,905 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:52 [2019-11-23 22:00:11,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 100 [2019-11-23 22:00:11,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:11,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:11,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:11,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-23 22:00:11,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,046 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 110 [2019-11-23 22:00:12,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,048 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,103 INFO L567 ElimStorePlain]: treesize reduction 26, result has 80.7 percent of original size [2019-11-23 22:00:12,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,104 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:117 [2019-11-23 22:00:12,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-23 22:00:12,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,212 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_91|, |v_#memory_$Pointer$.offset_71|], 6=[|v_#memory_$Pointer$.base_75|]} [2019-11-23 22:00:12,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:12,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 22:00:12,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,281 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 22:00:12,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2019-11-23 22:00:12,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,283 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:12,350 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.0 percent of original size [2019-11-23 22:00:12,412 INFO L343 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2019-11-23 22:00:12,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 82 [2019-11-23 22:00:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:12,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,417 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:12,480 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-11-23 22:00:12,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,481 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:166, output treesize:82 [2019-11-23 22:00:12,537 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_72|], 6=[|v_#memory_int_92|, |v_#memory_$Pointer$.base_76|]} [2019-11-23 22:00:12,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 252 [2019-11-23 22:00:12,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:12,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-23 22:00:12,681 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-11-23 22:00:12,681 INFO L567 ElimStorePlain]: treesize reduction 547, result has 34.6 percent of original size [2019-11-23 22:00:12,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:12,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 43 [2019-11-23 22:00:12,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:12,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 193 [2019-11-23 22:00:12,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:12,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:12,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:12,778 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:12,927 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-11-23 22:00:12,928 INFO L567 ElimStorePlain]: treesize reduction 1141, result has 15.5 percent of original size [2019-11-23 22:00:12,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:12,938 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:307, output treesize:247 [2019-11-23 22:00:12,991 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_93|, |v_#memory_$Pointer$.offset_73|], 12=[|v_#memory_$Pointer$.base_77|]} [2019-11-23 22:00:12,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 90 [2019-11-23 22:00:12,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:13,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:13,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:13,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 467 treesize of output 410 [2019-11-23 22:00:13,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:13,180 INFO L567 ElimStorePlain]: treesize reduction 168, result has 64.3 percent of original size [2019-11-23 22:00:13,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:13,245 INFO L377 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 300 treesize of output 240 [2019-11-23 22:00:13,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:13,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:13,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:13,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:13,249 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:13,341 INFO L567 ElimStorePlain]: treesize reduction 977, result has 18.9 percent of original size [2019-11-23 22:00:13,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:13,342 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:502, output treesize:228 [2019-11-23 22:00:13,462 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-23 22:00:13,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:13,469 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 191 [2019-11-23 22:00:13,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:13,528 INFO L567 ElimStorePlain]: treesize reduction 44, result has 78.4 percent of original size [2019-11-23 22:00:13,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:13,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 95 [2019-11-23 22:00:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:13,558 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:13,604 INFO L567 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-11-23 22:00:13,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:13,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:246, output treesize:49 [2019-11-23 22:00:13,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:13,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2019-11-23 22:00:13,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:13,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:13,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:13,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:56, output treesize:3 [2019-11-23 22:00:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:13,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:13,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2019-11-23 22:00:13,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933492330] [2019-11-23 22:00:13,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 22:00:13,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 22:00:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:00:13,699 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 26 states. [2019-11-23 22:00:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:15,471 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2019-11-23 22:00:15,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 22:00:15,471 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-11-23 22:00:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:15,472 INFO L225 Difference]: With dead ends: 131 [2019-11-23 22:00:15,473 INFO L226 Difference]: Without dead ends: 121 [2019-11-23 22:00:15,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 22:00:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-23 22:00:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-11-23 22:00:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 22:00:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2019-11-23 22:00:15,482 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 32 [2019-11-23 22:00:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:15,482 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2019-11-23 22:00:15,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 22:00:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2019-11-23 22:00:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:00:15,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:15,483 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:15,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:15,686 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:15,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1952757588, now seen corresponding path program 4 times [2019-11-23 22:00:15,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:15,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740173694] [2019-11-23 22:00:15,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:16,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740173694] [2019-11-23 22:00:16,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338409402] [2019-11-23 22:00:16,228 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:16,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:00:16,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:00:16,292 WARN L253 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-23 22:00:16,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:16,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 22:00:16,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:00:16,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:16,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,347 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 22:00:16,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 22:00:16,382 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:16,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,404 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:16,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 22:00:16,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 22:00:16,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,576 INFO L567 ElimStorePlain]: treesize reduction 40, result has 68.5 percent of original size [2019-11-23 22:00:16,600 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 22:00:16,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2019-11-23 22:00:16,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,646 INFO L567 ElimStorePlain]: treesize reduction 8, result has 88.2 percent of original size [2019-11-23 22:00:16,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:16,650 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,668 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:45 [2019-11-23 22:00:16,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 116 [2019-11-23 22:00:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:16,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 22:00:16,804 INFO L567 ElimStorePlain]: treesize reduction 114, result has 51.1 percent of original size [2019-11-23 22:00:16,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2019-11-23 22:00:16,808 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,834 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:119 [2019-11-23 22:00:16,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-23 22:00:16,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:16,948 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_94|], 6=[|v_#memory_$Pointer$.offset_77|, |v_#memory_$Pointer$.base_81|]} [2019-11-23 22:00:16,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:00:16,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:16,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:17,038 INFO L343 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2019-11-23 22:00:17,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 106 [2019-11-23 22:00:17,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,041 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:17,110 INFO L567 ElimStorePlain]: treesize reduction 22, result has 85.3 percent of original size [2019-11-23 22:00:17,174 INFO L343 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2019-11-23 22:00:17,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 84 [2019-11-23 22:00:17,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,178 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:17,240 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.6 percent of original size [2019-11-23 22:00:17,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:17,241 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:168, output treesize:84 [2019-11-23 22:00:17,305 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_95|], 6=[|v_#memory_$Pointer$.base_82|, |v_#memory_$Pointer$.offset_78|]} [2019-11-23 22:00:17,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:17,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 39 [2019-11-23 22:00:17,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:17,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:17,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:17,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 231 [2019-11-23 22:00:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2019-11-23 22:00:17,568 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-11-23 22:00:17,569 INFO L567 ElimStorePlain]: treesize reduction 3272, result has 8.0 percent of original size [2019-11-23 22:00:17,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:17,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 260 treesize of output 229 [2019-11-23 22:00:17,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,618 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-11-23 22:00:17,797 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-11-23 22:00:17,798 INFO L567 ElimStorePlain]: treesize reduction 3076, result has 7.9 percent of original size [2019-11-23 22:00:17,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:17,799 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:390, output treesize:330 [2019-11-23 22:00:17,864 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_96|], 12=[|v_#memory_$Pointer$.offset_79|, |v_#memory_$Pointer$.base_83|]} [2019-11-23 22:00:17,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2019-11-23 22:00:17,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:17,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:17,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:17,989 INFO L377 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 8 new quantified variables, introduced 5 case distinctions, treesize of input 690 treesize of output 482 [2019-11-23 22:00:17,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:17,993 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:18,093 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-11-23 22:00:18,094 INFO L567 ElimStorePlain]: treesize reduction 440, result has 48.5 percent of original size [2019-11-23 22:00:18,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:18,181 INFO L377 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 7 new quantified variables, introduced 5 case distinctions, treesize of input 411 treesize of output 252 [2019-11-23 22:00:18,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:18,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:18,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:18,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:18,196 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:18,422 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 46 [2019-11-23 22:00:18,422 INFO L567 ElimStorePlain]: treesize reduction 18730, result has 1.6 percent of original size [2019-11-23 22:00:18,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:18,423 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:739, output treesize:297 [2019-11-23 22:00:18,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:18,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 328 treesize of output 153 [2019-11-23 22:00:18,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:18,678 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:18,737 INFO L567 ElimStorePlain]: treesize reduction 76, result has 52.5 percent of original size [2019-11-23 22:00:18,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 24 [2019-11-23 22:00:18,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:18,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:18,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:18,757 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:335, output treesize:30 [2019-11-23 22:00:18,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:18,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 21 [2019-11-23 22:00:18,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:18,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:18,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:18,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-23 22:00:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:18,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:18,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2019-11-23 22:00:18,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317466967] [2019-11-23 22:00:18,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-23 22:00:18,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:18,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-23 22:00:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:00:18,823 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 26 states. [2019-11-23 22:00:19,893 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-23 22:00:20,275 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-11-23 22:00:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:20,946 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-11-23 22:00:20,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:00:20,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-11-23 22:00:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:20,948 INFO L225 Difference]: With dead ends: 129 [2019-11-23 22:00:20,948 INFO L226 Difference]: Without dead ends: 125 [2019-11-23 22:00:20,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=186, Invalid=1454, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 22:00:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-23 22:00:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2019-11-23 22:00:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-23 22:00:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2019-11-23 22:00:20,959 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 32 [2019-11-23 22:00:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:20,960 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2019-11-23 22:00:20,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-23 22:00:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2019-11-23 22:00:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:00:20,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:20,960 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:21,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:21,161 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1653055636, now seen corresponding path program 4 times [2019-11-23 22:00:21,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:21,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371345873] [2019-11-23 22:00:21,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:21,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371345873] [2019-11-23 22:00:21,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022391231] [2019-11-23 22:00:21,639 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:21,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 22:00:21,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 22:00:21,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-23 22:00:21,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:21,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 22:00:21,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:21,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:21,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:21,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 22:00:21,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:21,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:21,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:21,810 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-23 22:00:21,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:21,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-23 22:00:21,850 INFO L377 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 13 treesize of output 9 [2019-11-23 22:00:21,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:21,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:21,870 INFO L377 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 13 treesize of output 9 [2019-11-23 22:00:21,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:21,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:21,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:21,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-23 22:00:21,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:21,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-23 22:00:21,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,070 INFO L567 ElimStorePlain]: treesize reduction 46, result has 67.1 percent of original size [2019-11-23 22:00:22,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:22,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 22:00:22,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,118 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 22:00:22,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2019-11-23 22:00:22,119 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,151 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.1 percent of original size [2019-11-23 22:00:22,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,152 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:46 [2019-11-23 22:00:22,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-23 22:00:22,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 132 [2019-11-23 22:00:22,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:22,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 22:00:22,318 INFO L567 ElimStorePlain]: treesize reduction 132, result has 49.6 percent of original size [2019-11-23 22:00:22,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:142 [2019-11-23 22:00:22,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 61 [2019-11-23 22:00:22,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,426 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_97|], 6=[|v_#memory_$Pointer$.offset_83|, |v_#memory_$Pointer$.base_87|]} [2019-11-23 22:00:22,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 22:00:22,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,523 INFO L343 Elim1Store]: treesize reduction 56, result has 45.6 percent of original size [2019-11-23 22:00:22,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 124 [2019-11-23 22:00:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,526 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:22,590 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.6 percent of original size [2019-11-23 22:00:22,661 INFO L343 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2019-11-23 22:00:22,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 82 [2019-11-23 22:00:22,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:22,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:22,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,666 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:22,725 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.3 percent of original size [2019-11-23 22:00:22,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,726 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:188, output treesize:92 [2019-11-23 22:00:22,780 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_98|], 6=[|v_#memory_$Pointer$.offset_84|, |v_#memory_$Pointer$.base_88|]} [2019-11-23 22:00:22,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 22:00:22,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 47 [2019-11-23 22:00:22,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:22,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:22,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 258 [2019-11-23 22:00:22,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:22,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:22,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 22:00:22,963 INFO L567 ElimStorePlain]: treesize reduction 771, result has 27.8 percent of original size [2019-11-23 22:00:23,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:23,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 293 treesize of output 236 [2019-11-23 22:00:23,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,027 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-11-23 22:00:23,181 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-11-23 22:00:23,182 INFO L567 ElimStorePlain]: treesize reduction 3298, result has 7.7 percent of original size [2019-11-23 22:00:23,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:23,183 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:428, output treesize:311 [2019-11-23 22:00:23,235 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_99|], 6=[|v_#memory_$Pointer$.offset_85|], 12=[|v_#memory_$Pointer$.base_89|]} [2019-11-23 22:00:23,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 96 [2019-11-23 22:00:23,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:23,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:23,319 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:23,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 587 treesize of output 429 [2019-11-23 22:00:23,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 22:00:23,424 INFO L567 ElimStorePlain]: treesize reduction 1351, result has 25.2 percent of original size [2019-11-23 22:00:23,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:23,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 456 treesize of output 289 [2019-11-23 22:00:23,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:23,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:23,626 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 12 xjuncts. [2019-11-23 22:00:24,056 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 42 [2019-11-23 22:00:24,057 INFO L567 ElimStorePlain]: treesize reduction 63942, result has 0.5 percent of original size [2019-11-23 22:00:24,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:24,057 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:643, output treesize:315 [2019-11-23 22:00:24,188 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-23 22:00:24,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 190 [2019-11-23 22:00:24,193 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:24,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:24,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:24,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 92 [2019-11-23 22:00:24,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:24,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:24,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:24,241 INFO L496 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:24,449 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-11-23 22:00:24,449 INFO L567 ElimStorePlain]: treesize reduction 12, result has 94.1 percent of original size [2019-11-23 22:00:24,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 22:00:24,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:24,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:24,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:24,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:24,454 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:357, output treesize:105 [2019-11-23 22:00:24,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 22:00:24,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:24,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:24,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:24,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 22:00:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:24,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:24,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2019-11-23 22:00:24,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362671335] [2019-11-23 22:00:24,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 22:00:24,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:24,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 22:00:24,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-11-23 22:00:24,553 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 27 states. [2019-11-23 22:00:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:00:26,273 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2019-11-23 22:00:26,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 22:00:26,274 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-23 22:00:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:00:26,275 INFO L225 Difference]: With dead ends: 127 [2019-11-23 22:00:26,275 INFO L226 Difference]: Without dead ends: 121 [2019-11-23 22:00:26,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 22:00:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-23 22:00:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2019-11-23 22:00:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-23 22:00:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-11-23 22:00:26,286 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 32 [2019-11-23 22:00:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:00:26,286 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-11-23 22:00:26,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 22:00:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-11-23 22:00:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:00:26,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:00:26,286 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:00:26,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:26,487 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:00:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:00:26,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1296176665, now seen corresponding path program 7 times [2019-11-23 22:00:26,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:00:26,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955215253] [2019-11-23 22:00:26,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:00:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:27,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955215253] [2019-11-23 22:00:27,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707675161] [2019-11-23 22:00:27,276 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:00:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:00:27,331 WARN L253 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-23 22:00:27,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:00:27,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 22:00:27,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 22:00:27,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 22:00:27,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,382 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 22:00:27,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 22:00:27,419 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:27,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,440 INFO L377 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 11 treesize of output 7 [2019-11-23 22:00:27,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 22:00:27,526 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 22:00:27,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,601 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.2 percent of original size [2019-11-23 22:00:27,626 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 22:00:27,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2019-11-23 22:00:27,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,678 INFO L567 ElimStorePlain]: treesize reduction 8, result has 88.7 percent of original size [2019-11-23 22:00:27,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 22:00:27,683 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,704 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:48 [2019-11-23 22:00:27,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2019-11-23 22:00:27,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 112 [2019-11-23 22:00:27,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:27,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 22:00:27,877 INFO L567 ElimStorePlain]: treesize reduction 106, result has 51.2 percent of original size [2019-11-23 22:00:27,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:136 [2019-11-23 22:00:27,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:27,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-23 22:00:27,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:27,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:28,062 INFO L343 Elim1Store]: treesize reduction 52, result has 54.0 percent of original size [2019-11-23 22:00:28,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 113 [2019-11-23 22:00:28,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:28,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:28,066 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:28,145 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.7 percent of original size [2019-11-23 22:00:28,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2019-11-23 22:00:28,149 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:28,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:28,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:28,176 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:174, output treesize:80 [2019-11-23 22:00:28,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:28,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 260 treesize of output 229 [2019-11-23 22:00:28,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:28,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-23 22:00:28,377 INFO L567 ElimStorePlain]: treesize reduction 561, result has 26.4 percent of original size [2019-11-23 22:00:28,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:28,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 164 [2019-11-23 22:00:28,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:28,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 22:00:28,553 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-11-23 22:00:28,554 INFO L567 ElimStorePlain]: treesize reduction 338, result has 32.8 percent of original size [2019-11-23 22:00:28,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:28,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:283, output treesize:198 [2019-11-23 22:00:28,654 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_100|], 11=[|v_#memory_$Pointer$.offset_91|, |v_#memory_$Pointer$.base_95|]} [2019-11-23 22:00:28,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2019-11-23 22:00:28,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:28,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:28,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:28,768 INFO L377 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 7 new quantified variables, introduced 5 case distinctions, treesize of input 398 treesize of output 421 [2019-11-23 22:00:28,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:28,836 INFO L567 ElimStorePlain]: treesize reduction 138, result has 64.4 percent of original size [2019-11-23 22:00:28,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:28,878 INFO L377 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 6 new quantified variables, introduced 4 case distinctions, treesize of input 247 treesize of output 185 [2019-11-23 22:00:28,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:28,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:28,880 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:28,962 INFO L567 ElimStorePlain]: treesize reduction 485, result has 27.2 percent of original size [2019-11-23 22:00:28,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:28,963 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:431, output treesize:181 [2019-11-23 22:00:29,385 INFO L343 Elim1Store]: treesize reduction 12, result has 85.5 percent of original size [2019-11-23 22:00:29,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 252 treesize of output 161 [2019-11-23 22:00:29,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:00:29,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 22:00:29,400 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:29,470 INFO L567 ElimStorePlain]: treesize reduction 91, result has 45.8 percent of original size [2019-11-23 22:00:29,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:29,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2019-11-23 22:00:29,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:29,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:29,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 22:00:29,501 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:259, output treesize:18 [2019-11-23 22:00:29,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 22:00:29,549 INFO L377 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 22 treesize of output 18 [2019-11-23 22:00:29,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 22:00:29,558 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-23 22:00:29,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 22:00:29,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 22:00:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:00:29,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:00:29,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2019-11-23 22:00:29,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833382887] [2019-11-23 22:00:29,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 22:00:29,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:00:29,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 22:00:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-11-23 22:00:29,570 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 28 states.