/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/forester-heap/sll-queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:28:46,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:28:46,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:28:46,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:28:46,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:28:46,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:28:46,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:28:46,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:28:46,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:28:46,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:28:46,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:28:46,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:28:46,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:28:46,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:28:46,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:28:46,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:28:46,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:28:46,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:28:46,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:28:46,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:28:46,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:28:46,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:28:46,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:28:46,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:28:46,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:28:46,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:28:46,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:28:46,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:28:46,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:28:46,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:28:46,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:28:46,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:28:46,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:28:46,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:28:46,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:28:46,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:28:46,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:28:46,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:28:46,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:28:46,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:28:46,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:28:46,845 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:28:46,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:28:46,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:28:46,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:28:46,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:28:46,880 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:28:46,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:28:46,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:28:46,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:28:46,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:28:46,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:28:46,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:28:46,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:28:46,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:28:46,885 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:28:46,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:28:46,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:28:46,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:28:46,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:28:46,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:28:46,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:28:46,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:28:46,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:28:46,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:28:46,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:28:46,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:28:46,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:28:46,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:28:46,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:28:46,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:28:46,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:28:47,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:28:47,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:28:47,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:28:47,197 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:28:47,197 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:28:47,198 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-11-23 21:28:47,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6432549b7/4a51ff3633b042f78e66d6df06ebf4a7/FLAGe0fa6767f [2019-11-23 21:28:47,745 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:28:47,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-2.i [2019-11-23 21:28:47,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6432549b7/4a51ff3633b042f78e66d6df06ebf4a7/FLAGe0fa6767f [2019-11-23 21:28:48,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6432549b7/4a51ff3633b042f78e66d6df06ebf4a7 [2019-11-23 21:28:48,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:28:48,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:28:48,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:28:48,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:28:48,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:28:48,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22286c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48, skipping insertion in model container [2019-11-23 21:28:48,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:28:48,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:28:48,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:28:48,681 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:28:48,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:28:48,778 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:28:48,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48 WrapperNode [2019-11-23 21:28:48,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:28:48,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:28:48,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:28:48,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:28:48,788 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:28:48" (1/1) ... [2019-11-23 21:28:48,804 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:28:48" (1/1) ... [2019-11-23 21:28:48,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:28:48,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:28:48,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:28:48,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:28:48,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (1/1) ... [2019-11-23 21:28:48,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:28:48,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:28:48,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:28:48,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:28:48,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (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:28:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:28:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:28:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:28:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:28:48,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:28:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:28:48,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:28:48,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:28:49,456 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:28:49,457 INFO L284 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-23 21:28:49,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:28:49 BoogieIcfgContainer [2019-11-23 21:28:49,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:28:49,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:28:49,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:28:49,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:28:49,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:28:48" (1/3) ... [2019-11-23 21:28:49,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b86f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:28:49, skipping insertion in model container [2019-11-23 21:28:49,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:28:48" (2/3) ... [2019-11-23 21:28:49,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b86f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:28:49, skipping insertion in model container [2019-11-23 21:28:49,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:28:49" (3/3) ... [2019-11-23 21:28:49,467 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-11-23 21:28:49,477 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:28:49,484 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-23 21:28:49,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-23 21:28:49,515 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:28:49,516 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:28:49,516 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:28:49,516 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:28:49,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:28:49,516 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:28:49,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:28:49,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:28:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 21:28:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-23 21:28:49,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:49,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-23 21:28:49,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:49,547 INFO L82 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2019-11-23 21:28:49,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:49,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465557419] [2019-11-23 21:28:49,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:49,683 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:28:49,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465557419] [2019-11-23 21:28:49,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:49,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:28:49,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181696738] [2019-11-23 21:28:49,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:28:49,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:49,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:28:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:28:49,709 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2019-11-23 21:28:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:49,739 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2019-11-23 21:28:49,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:28:49,740 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-23 21:28:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:49,753 INFO L225 Difference]: With dead ends: 168 [2019-11-23 21:28:49,753 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 21:28:49,757 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:28:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 21:28:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-23 21:28:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-23 21:28:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-11-23 21:28:49,800 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-11-23 21:28:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:49,801 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-11-23 21:28:49,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:28:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-11-23 21:28:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-23 21:28:49,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:49,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-23 21:28:49,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2019-11-23 21:28:49,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:49,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819435944] [2019-11-23 21:28:49,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:49,859 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:28:49,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819435944] [2019-11-23 21:28:49,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:49,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:28:49,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919272659] [2019-11-23 21:28:49,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:28:49,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:28:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:49,863 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2019-11-23 21:28:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:49,912 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-23 21:28:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:28:49,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-23 21:28:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:49,914 INFO L225 Difference]: With dead ends: 80 [2019-11-23 21:28:49,914 INFO L226 Difference]: Without dead ends: 70 [2019-11-23 21:28:49,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-23 21:28:49,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-23 21:28:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-23 21:28:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-11-23 21:28:49,925 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2019-11-23 21:28:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:49,925 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-11-23 21:28:49,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:28:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-11-23 21:28:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 21:28:49,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:49,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:49,927 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2019-11-23 21:28:49,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:49,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480933336] [2019-11-23 21:28:49,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:49,987 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:28:49,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480933336] [2019-11-23 21:28:49,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:49,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:28:49,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895099601] [2019-11-23 21:28:49,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:28:49,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:28:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:49,990 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 3 states. [2019-11-23 21:28:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:50,025 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-23 21:28:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:28:50,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-23 21:28:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:50,027 INFO L225 Difference]: With dead ends: 70 [2019-11-23 21:28:50,027 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 21:28:50,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 21:28:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-23 21:28:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 21:28:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-11-23 21:28:50,036 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2019-11-23 21:28:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:50,036 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-11-23 21:28:50,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:28:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-11-23 21:28:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 21:28:50,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:50,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:50,038 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2019-11-23 21:28:50,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:50,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231112254] [2019-11-23 21:28:50,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:50,125 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:28:50,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231112254] [2019-11-23 21:28:50,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:50,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:28:50,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542038424] [2019-11-23 21:28:50,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:28:50,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:28:50,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:50,128 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 3 states. [2019-11-23 21:28:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:50,184 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-11-23 21:28:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:28:50,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-23 21:28:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:50,185 INFO L225 Difference]: With dead ends: 153 [2019-11-23 21:28:50,186 INFO L226 Difference]: Without dead ends: 87 [2019-11-23 21:28:50,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-23 21:28:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-11-23 21:28:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-23 21:28:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-23 21:28:50,196 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2019-11-23 21:28:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:50,196 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-23 21:28:50,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:28:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-23 21:28:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 21:28:50,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:50,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:50,198 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2019-11-23 21:28:50,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:50,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465716087] [2019-11-23 21:28:50,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:50,324 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:28:50,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465716087] [2019-11-23 21:28:50,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:50,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:28:50,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405629419] [2019-11-23 21:28:50,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:28:50,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:28:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:28:50,326 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2019-11-23 21:28:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:50,475 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-23 21:28:50,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:28:50,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-23 21:28:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:50,478 INFO L225 Difference]: With dead ends: 91 [2019-11-23 21:28:50,478 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 21:28:50,478 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:28:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 21:28:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-23 21:28:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-23 21:28:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-11-23 21:28:50,490 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2019-11-23 21:28:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:50,490 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-11-23 21:28:50,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:28:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-11-23 21:28:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:28:50,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:50,495 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:50,495 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2019-11-23 21:28:50,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:50,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455209312] [2019-11-23 21:28:50,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:50,615 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:28:50,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455209312] [2019-11-23 21:28:50,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225761279] [2019-11-23 21:28:50,616 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:28:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:50,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-23 21:28:50,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:28:50,776 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:28:50,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:50,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:50,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:50,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:28:50,813 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:50,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:28:50,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:50,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:50,832 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 27 treesize of output 15 [2019-11-23 21:28:50,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:50,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:50,845 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:28:50,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-23 21:28:50,937 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-23 21:28:50,938 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 59 treesize of output 78 [2019-11-23 21:28:50,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:50,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:50,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:50,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-23 21:28:50,983 INFO L567 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-11-23 21:28:50,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:28:50,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-23 21:28:51,057 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:51,058 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 35 treesize of output 30 [2019-11-23 21:28:51,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:51,072 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-23 21:28:51,073 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:28:51,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-23 21:28:51,081 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:28:51,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:28:51,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-23 21:28:51,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202493360] [2019-11-23 21:28:51,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:28:51,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:28:51,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:28:51,084 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 9 states. [2019-11-23 21:28:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:51,341 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2019-11-23 21:28:51,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:28:51,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-23 21:28:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:51,344 INFO L225 Difference]: With dead ends: 134 [2019-11-23 21:28:51,344 INFO L226 Difference]: Without dead ends: 132 [2019-11-23 21:28:51,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:28:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-23 21:28:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 84. [2019-11-23 21:28:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-23 21:28:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-11-23 21:28:51,354 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2019-11-23 21:28:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:51,354 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-11-23 21:28:51,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:28:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-11-23 21:28:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:28:51,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:51,356 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:28:51,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:28:51,559 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2019-11-23 21:28:51,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:51,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36032927] [2019-11-23 21:28:51,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:51,624 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:28:51,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36032927] [2019-11-23 21:28:51,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:51,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:28:51,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359102919] [2019-11-23 21:28:51,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:28:51,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:51,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:28:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:51,628 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 3 states. [2019-11-23 21:28:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:51,669 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2019-11-23 21:28:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:28:51,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 21:28:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:51,670 INFO L225 Difference]: With dead ends: 174 [2019-11-23 21:28:51,670 INFO L226 Difference]: Without dead ends: 108 [2019-11-23 21:28:51,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-23 21:28:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-11-23 21:28:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-23 21:28:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-11-23 21:28:51,691 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2019-11-23 21:28:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:51,692 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-11-23 21:28:51,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:28:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-11-23 21:28:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 21:28:51,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:51,693 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] [2019-11-23 21:28:51,694 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:51,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:51,697 INFO L82 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2019-11-23 21:28:51,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:51,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102579110] [2019-11-23 21:28:51,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:28:51,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102579110] [2019-11-23 21:28:51,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:51,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:28:51,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229844226] [2019-11-23 21:28:51,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:28:51,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:28:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:51,740 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 3 states. [2019-11-23 21:28:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:51,774 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2019-11-23 21:28:51,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:28:51,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 21:28:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:51,776 INFO L225 Difference]: With dead ends: 201 [2019-11-23 21:28:51,776 INFO L226 Difference]: Without dead ends: 122 [2019-11-23 21:28:51,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-23 21:28:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-11-23 21:28:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-23 21:28:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-11-23 21:28:51,783 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2019-11-23 21:28:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:51,784 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-11-23 21:28:51,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:28:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-11-23 21:28:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 21:28:51,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:51,785 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] [2019-11-23 21:28:51,786 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2019-11-23 21:28:51,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:51,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460158741] [2019-11-23 21:28:51,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:28:51,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460158741] [2019-11-23 21:28:51,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686009150] [2019-11-23 21:28:51,979 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:28:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:52,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 21:28:52,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:28:52,071 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:28:52,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:28:52,113 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-11-23 21:28:52,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,151 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-23 21:28:52,159 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 27 treesize of output 15 [2019-11-23 21:28:52,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,177 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:28:52,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-23 21:28:52,224 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:28:52,225 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:28:52,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2019-11-23 21:28:52,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:28:52,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,345 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 4 case distinctions, treesize of input 79 treesize of output 100 [2019-11-23 21:28:52,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:52,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:52,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:52,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:52,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:52,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,399 INFO L567 ElimStorePlain]: treesize reduction 209, result has 18.4 percent of original size [2019-11-23 21:28:52,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:28:52,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:47 [2019-11-23 21:28:52,583 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 21:28:52,585 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-23 21:28:52,586 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 142 [2019-11-23 21:28:52,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:52,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:52,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,619 INFO L567 ElimStorePlain]: treesize reduction 116, result has 34.1 percent of original size [2019-11-23 21:28:52,620 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:28:52,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2019-11-23 21:28:52,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:52,692 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 67 treesize of output 65 [2019-11-23 21:28:52,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:52,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:52,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:52,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:52,707 INFO L567 ElimStorePlain]: treesize reduction 9, result has 50.0 percent of original size [2019-11-23 21:28:52,708 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:28:52,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2019-11-23 21:28:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:28:52,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:28:52,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-23 21:28:52,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665509360] [2019-11-23 21:28:52,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:28:52,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:52,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:28:52,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:28:52,722 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-11-23 21:28:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:53,419 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2019-11-23 21:28:53,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:28:53,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-23 21:28:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:53,421 INFO L225 Difference]: With dead ends: 170 [2019-11-23 21:28:53,421 INFO L226 Difference]: Without dead ends: 168 [2019-11-23 21:28:53,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:28:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-23 21:28:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2019-11-23 21:28:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-23 21:28:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2019-11-23 21:28:53,428 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2019-11-23 21:28:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:53,429 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2019-11-23 21:28:53,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:28:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2019-11-23 21:28:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:28:53,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:53,430 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:53,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:28:53,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2019-11-23 21:28:53,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:53,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529256811] [2019-11-23 21:28:53,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 21:28:53,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529256811] [2019-11-23 21:28:53,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:53,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:28:53,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959730401] [2019-11-23 21:28:53,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:28:53,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:53,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:28:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:53,680 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 3 states. [2019-11-23 21:28:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:53,693 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2019-11-23 21:28:53,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:28:53,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 21:28:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:53,694 INFO L225 Difference]: With dead ends: 129 [2019-11-23 21:28:53,694 INFO L226 Difference]: Without dead ends: 127 [2019-11-23 21:28:53,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-23 21:28:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-23 21:28:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-23 21:28:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2019-11-23 21:28:53,700 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 29 [2019-11-23 21:28:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:53,701 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2019-11-23 21:28:53,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:28:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2019-11-23 21:28:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:28:53,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:53,702 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:53,702 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:53,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2019-11-23 21:28:53,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:53,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376409675] [2019-11-23 21:28:53,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:54,088 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:28:54,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376409675] [2019-11-23 21:28:54,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492184394] [2019-11-23 21:28:54,092 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:28:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:54,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 21:28:54,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:28:54,159 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:28:54,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:28:54,207 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,207 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:28:54,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,230 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 27 treesize of output 15 [2019-11-23 21:28:54,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,246 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 27 treesize of output 15 [2019-11-23 21:28:54,247 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,258 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:28:54,258 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-23 21:28:54,302 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_17|], 4=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_30|]} [2019-11-23 21:28:54,308 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 19 treesize of output 11 [2019-11-23 21:28:54,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,332 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 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-23 21:28:54,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,376 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 2 case distinctions, treesize of input 69 treesize of output 90 [2019-11-23 21:28:54,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:54,379 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,403 INFO L567 ElimStorePlain]: treesize reduction 56, result has 46.7 percent of original size [2019-11-23 21:28:54,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,404 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2019-11-23 21:28:54,462 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,463 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 49 treesize of output 40 [2019-11-23 21:28:54,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,483 INFO L567 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-11-23 21:28:54,485 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:28:54,486 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:54,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:54,494 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:28:54,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-11-23 21:28:54,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:54,522 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:28:54,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:28:54,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-11-23 21:28:54,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996721573] [2019-11-23 21:28:54,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:28:54,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:28:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:28:54,524 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand 14 states. [2019-11-23 21:28:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:55,362 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2019-11-23 21:28:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:28:55,363 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-23 21:28:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:55,364 INFO L225 Difference]: With dead ends: 163 [2019-11-23 21:28:55,364 INFO L226 Difference]: Without dead ends: 161 [2019-11-23 21:28:55,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:28:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-23 21:28:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 136. [2019-11-23 21:28:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-23 21:28:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2019-11-23 21:28:55,377 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2019-11-23 21:28:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:55,377 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2019-11-23 21:28:55,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:28:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2019-11-23 21:28:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:28:55,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:55,381 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, 1] [2019-11-23 21:28:55,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:28:55,585 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2019-11-23 21:28:55,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:55,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322400516] [2019-11-23 21:28:55,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:28:55,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322400516] [2019-11-23 21:28:55,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039656892] [2019-11-23 21:28:55,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -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:28:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:55,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 21:28:55,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:28:55,815 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:28:55,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:55,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:55,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:55,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:28:55,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:55,854 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:28:55,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:55,918 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:28:55,926 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 27 treesize of output 15 [2019-11-23 21:28:55,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:55,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:55,953 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 27 treesize of output 15 [2019-11-23 21:28:55,953 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:55,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:55,971 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:28:55,971 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:28:56,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:28:56,016 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 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:28:56,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:28:56,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:28:56,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-23 21:28:56,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:28:56,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-23 21:28:56,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,243 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 4 case distinctions, treesize of input 82 treesize of output 103 [2019-11-23 21:28:56,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,245 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,296 INFO L567 ElimStorePlain]: treesize reduction 76, result has 47.2 percent of original size [2019-11-23 21:28:56,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,297 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:147, output treesize:57 [2019-11-23 21:28:56,361 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_28|], 12=[|v_#memory_$Pointer$.base_34|]} [2019-11-23 21:28:56,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:28:56,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-23 21:28:56,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,491 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-23 21:28:56,492 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 149 [2019-11-23 21:28:56,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:56,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-23 21:28:56,608 INFO L567 ElimStorePlain]: treesize reduction 1591, result has 5.1 percent of original size [2019-11-23 21:28:56,609 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:28:56,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:172, output treesize:86 [2019-11-23 21:28:56,661 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-23 21:28:56,666 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 38 treesize of output 18 [2019-11-23 21:28:56,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:56,699 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 75 treesize of output 65 [2019-11-23 21:28:56,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:56,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,714 INFO L567 ElimStorePlain]: treesize reduction 30, result has 23.1 percent of original size [2019-11-23 21:28:56,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:56,715 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:101, output treesize:4 [2019-11-23 21:28:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:28:56,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:28:56,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-23 21:28:56,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021398938] [2019-11-23 21:28:56,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:28:56,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:56,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:28:56,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:28:56,729 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand 12 states. [2019-11-23 21:28:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:57,279 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2019-11-23 21:28:57,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:28:57,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-23 21:28:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:57,282 INFO L225 Difference]: With dead ends: 169 [2019-11-23 21:28:57,282 INFO L226 Difference]: Without dead ends: 167 [2019-11-23 21:28:57,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:28:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-23 21:28:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-11-23 21:28:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-23 21:28:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2019-11-23 21:28:57,291 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 31 [2019-11-23 21:28:57,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:57,292 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2019-11-23 21:28:57,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:28:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2019-11-23 21:28:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:28:57,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:57,293 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:57,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:28:57,497 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:57,498 INFO L82 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2019-11-23 21:28:57,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:57,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568587411] [2019-11-23 21:28:57,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 21:28:57,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568587411] [2019-11-23 21:28:57,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:57,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:28:57,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342787107] [2019-11-23 21:28:57,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:28:57,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:28:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:57,541 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 3 states. [2019-11-23 21:28:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:57,586 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2019-11-23 21:28:57,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:28:57,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 21:28:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:57,587 INFO L225 Difference]: With dead ends: 204 [2019-11-23 21:28:57,588 INFO L226 Difference]: Without dead ends: 111 [2019-11-23 21:28:57,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:28:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-23 21:28:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-11-23 21:28:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 21:28:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2019-11-23 21:28:57,596 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2019-11-23 21:28:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:57,597 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2019-11-23 21:28:57,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:28:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2019-11-23 21:28:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:28:57,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:57,599 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:57,599 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 525270376, now seen corresponding path program 1 times [2019-11-23 21:28:57,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:57,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212798339] [2019-11-23 21:28:57,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:28:57,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212798339] [2019-11-23 21:28:57,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:28:57,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:28:57,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061097585] [2019-11-23 21:28:57,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:28:57,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:57,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:28:57,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:28:57,688 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2019-11-23 21:28:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:57,746 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-23 21:28:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:28:57,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-23 21:28:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:57,748 INFO L225 Difference]: With dead ends: 118 [2019-11-23 21:28:57,748 INFO L226 Difference]: Without dead ends: 107 [2019-11-23 21:28:57,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:28:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-23 21:28:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-23 21:28:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-23 21:28:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-23 21:28:57,755 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 37 [2019-11-23 21:28:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:57,756 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-23 21:28:57,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:28:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-23 21:28:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:28:57,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:57,757 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:57,757 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:57,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:57,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1226334954, now seen corresponding path program 1 times [2019-11-23 21:28:57,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:57,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528912789] [2019-11-23 21:28:57,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:58,002 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:28:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528912789] [2019-11-23 21:28:58,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133533015] [2019-11-23 21:28:58,003 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:28:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:58,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 21:28:58,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:28:58,075 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:28:58,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:28:58,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,097 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:28:58,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,118 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 27 treesize of output 15 [2019-11-23 21:28:58,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,152 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 27 treesize of output 15 [2019-11-23 21:28:58,152 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,173 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:28:58,173 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-23 21:28:58,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,223 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 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-23 21:28:58,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:58,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:58,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:58,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-23 21:28:58,270 INFO L567 ElimStorePlain]: treesize reduction 221, result has 22.7 percent of original size [2019-11-23 21:28:58,274 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 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-23 21:28:58,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,296 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-11-23 21:28:58,394 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,395 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-11-23 21:28:58,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:58,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:58,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:58,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:58,404 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:28:58,432 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-23 21:28:58,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,440 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-23 21:28:58,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:58,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:58,447 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:28:58,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-23 21:28:58,459 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:28:58,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:28:58,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-11-23 21:28:58,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398243414] [2019-11-23 21:28:58,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:28:58,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:28:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:28:58,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:28:58,462 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 14 states. [2019-11-23 21:28:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:28:58,840 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-11-23 21:28:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:28:58,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-23 21:28:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:28:58,841 INFO L225 Difference]: With dead ends: 111 [2019-11-23 21:28:58,841 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 21:28:58,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:28:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 21:28:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-23 21:28:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-23 21:28:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-11-23 21:28:58,847 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 37 [2019-11-23 21:28:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:28:58,847 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-11-23 21:28:58,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:28:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-11-23 21:28:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 21:28:58,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:28:58,848 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:28:59,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:28:59,052 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:28:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:28:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash 778254669, now seen corresponding path program 1 times [2019-11-23 21:28:59,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:28:59,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342171054] [2019-11-23 21:28:59,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:28:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:28:59,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342171054] [2019-11-23 21:28:59,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941686026] [2019-11-23 21:28:59,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -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:28:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:28:59,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 21:28:59,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:28:59,357 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:28:59,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:59,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:28:59,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:59,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-11-23 21:28:59,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,437 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-23 21:28:59,442 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 27 treesize of output 15 [2019-11-23 21:28:59,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:59,458 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:28:59,459 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-23 21:28:59,501 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:28:59,502 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:28:59,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:59,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-23 21:28:59,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:59,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 21:28:59,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,706 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-11-23 21:28:59,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:28:59,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 105 [2019-11-23 21:28:59,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:59,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:59,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:59,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:59,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:28:59,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:28:59,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:28:59,889 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-11-23 21:28:59,889 INFO L567 ElimStorePlain]: treesize reduction 902, result has 7.1 percent of original size [2019-11-23 21:28:59,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:28:59,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-11-23 21:29:00,014 INFO L343 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-11-23 21:29:00,015 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-11-23 21:29:00,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:00,064 INFO L567 ElimStorePlain]: treesize reduction 34, result has 66.0 percent of original size [2019-11-23 21:29:00,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:00,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2019-11-23 21:29:00,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:00,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-23 21:29:00,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:00,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:00,282 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-23 21:29:00,283 INFO L343 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-11-23 21:29:00,284 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 177 [2019-11-23 21:29:00,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:00,500 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-11-23 21:29:00,501 INFO L567 ElimStorePlain]: treesize reduction 3972, result has 2.2 percent of original size [2019-11-23 21:29:00,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:00,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:91 [2019-11-23 21:29:00,778 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-11-23 21:29:00,779 INFO L343 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-23 21:29:00,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 179 treesize of output 222 [2019-11-23 21:29:00,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:00,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:29:00,872 INFO L567 ElimStorePlain]: treesize reduction 625, result has 16.6 percent of original size [2019-11-23 21:29:00,874 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:29:00,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2019-11-23 21:29:00,979 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:00,979 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 131 treesize of output 116 [2019-11-23 21:29:00,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:00,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:01,020 INFO L567 ElimStorePlain]: treesize reduction 271, result has 3.2 percent of original size [2019-11-23 21:29:01,021 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:29:01,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2019-11-23 21:29:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:01,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:01,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2019-11-23 21:29:01,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381300381] [2019-11-23 21:29:01,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 21:29:01,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 21:29:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:29:01,040 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 17 states. [2019-11-23 21:29:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:01,738 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-11-23 21:29:01,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:29:01,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-11-23 21:29:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:01,740 INFO L225 Difference]: With dead ends: 149 [2019-11-23 21:29:01,740 INFO L226 Difference]: Without dead ends: 147 [2019-11-23 21:29:01,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:29:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-23 21:29:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2019-11-23 21:29:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-23 21:29:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-23 21:29:01,746 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2019-11-23 21:29:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:01,746 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-23 21:29:01,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 21:29:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-23 21:29:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 21:29:01,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:01,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:01,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:01,954 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1793269558, now seen corresponding path program 1 times [2019-11-23 21:29:01,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:01,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134700145] [2019-11-23 21:29:01,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:02,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134700145] [2019-11-23 21:29:02,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809239406] [2019-11-23 21:29:02,353 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:29:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:02,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 21:29:02,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:02,412 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:29:02,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:02,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,458 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:29:02,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,506 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:29:02,516 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 27 treesize of output 15 [2019-11-23 21:29:02,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,541 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 27 treesize of output 15 [2019-11-23 21:29:02,541 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,560 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:29:02,560 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:29:02,596 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 6=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_44|]} [2019-11-23 21:29:02,601 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:29:02,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:02,635 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 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:02,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:02,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:02,666 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,685 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-11-23 21:29:02,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,752 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:29:02,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,807 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_int_18|], 9=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_33|]} [2019-11-23 21:29:02,818 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 39 treesize of output 15 [2019-11-23 21:29:02,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,865 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 15 [2019-11-23 21:29:02,866 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:02,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:02,956 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 4 case distinctions, treesize of input 136 treesize of output 137 [2019-11-23 21:29:02,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:02,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:02,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:02,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:02,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:02,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:02,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:02,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:02,965 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:03,237 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-11-23 21:29:03,238 INFO L567 ElimStorePlain]: treesize reduction 1388, result has 7.4 percent of original size [2019-11-23 21:29:03,248 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 62 treesize of output 32 [2019-11-23 21:29:03,249 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:03,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:03,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:03,276 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:196, output treesize:64 [2019-11-23 21:29:03,339 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_21|], 6=[|v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_$Pointer$.base_46|]} [2019-11-23 21:29:03,344 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 41 treesize of output 32 [2019-11-23 21:29:03,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:03,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:03,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:03,390 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 66 treesize of output 29 [2019-11-23 21:29:03,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:03,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:03,523 INFO L343 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-23 21:29:03,523 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 161 [2019-11-23 21:29:03,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,542 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2019-11-23 21:29:03,686 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-23 21:29:03,687 INFO L567 ElimStorePlain]: treesize reduction 1955, result has 5.0 percent of original size [2019-11-23 21:29:03,688 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:29:03,688 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:200, output treesize:102 [2019-11-23 21:29:03,783 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-23 21:29:03,787 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 30 treesize of output 10 [2019-11-23 21:29:03,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:03,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:03,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:03,823 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 87 treesize of output 77 [2019-11-23 21:29:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:03,829 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:29:03,856 INFO L567 ElimStorePlain]: treesize reduction 36, result has 47.1 percent of original size [2019-11-23 21:29:03,857 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:29:03,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:24 [2019-11-23 21:29:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:03,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:03,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-23 21:29:03,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637514570] [2019-11-23 21:29:03,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 21:29:03,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:03,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 21:29:03,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:29:03,920 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 15 states. [2019-11-23 21:29:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:04,754 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-23 21:29:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:29:04,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-11-23 21:29:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:04,756 INFO L225 Difference]: With dead ends: 101 [2019-11-23 21:29:04,756 INFO L226 Difference]: Without dead ends: 99 [2019-11-23 21:29:04,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:29:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-23 21:29:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2019-11-23 21:29:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-23 21:29:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2019-11-23 21:29:04,763 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 40 [2019-11-23 21:29:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:04,763 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2019-11-23 21:29:04,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 21:29:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2019-11-23 21:29:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:29:04,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:04,764 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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:29:04,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:04,965 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1428751921, now seen corresponding path program 1 times [2019-11-23 21:29:04,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:04,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785093440] [2019-11-23 21:29:04,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 21:29:04,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785093440] [2019-11-23 21:29:04,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:29:04,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:29:04,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710142123] [2019-11-23 21:29:04,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:29:04,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:04,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:29:04,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:29:04,996 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 3 states. [2019-11-23 21:29:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:05,022 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-11-23 21:29:05,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:29:05,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-23 21:29:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:05,023 INFO L225 Difference]: With dead ends: 110 [2019-11-23 21:29:05,023 INFO L226 Difference]: Without dead ends: 98 [2019-11-23 21:29:05,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:29:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-23 21:29:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-11-23 21:29:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-23 21:29:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-23 21:29:05,029 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2019-11-23 21:29:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:05,030 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-23 21:29:05,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:29:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-23 21:29:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:29:05,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:05,031 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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:29:05,031 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 755507507, now seen corresponding path program 1 times [2019-11-23 21:29:05,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:05,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931893669] [2019-11-23 21:29:05,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:05,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931893669] [2019-11-23 21:29:05,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842693088] [2019-11-23 21:29:05,366 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:29:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:05,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-23 21:29:05,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:05,430 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:29:05,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:05,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,459 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:29:05,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,511 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:29:05,521 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 27 treesize of output 15 [2019-11-23 21:29:05,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,545 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 27 treesize of output 15 [2019-11-23 21:29:05,545 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,571 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:29:05,572 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:29:05,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:05,616 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 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:05,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:05,641 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 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:05,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,663 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-23 21:29:05,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-23 21:29:05,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,860 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-23 21:29:05,860 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.2 percent of original size [2019-11-23 21:29:05,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, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-23 21:29:05,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:05,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,951 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:05,952 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 4 case distinctions, treesize of input 91 treesize of output 108 [2019-11-23 21:29:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:05,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:05,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:05,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:05,957 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:06,096 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-11-23 21:29:06,096 INFO L567 ElimStorePlain]: treesize reduction 481, result has 15.8 percent of original size [2019-11-23 21:29:06,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:06,097 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:156, output treesize:79 [2019-11-23 21:29:06,217 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_38|], 12=[|v_#memory_$Pointer$.base_50|]} [2019-11-23 21:29:06,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:06,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, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:06,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:06,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:06,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:06,311 INFO L343 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-23 21:29:06,311 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 78 [2019-11-23 21:29:06,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:06,378 INFO L567 ElimStorePlain]: treesize reduction 50, result has 60.3 percent of original size [2019-11-23 21:29:06,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:06,378 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:76 [2019-11-23 21:29:06,419 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:06,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-23 21:29:06,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:06,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:06,477 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_39|], 18=[|v_#memory_$Pointer$.base_51|]} [2019-11-23 21:29:06,484 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 82 treesize of output 36 [2019-11-23 21:29:06,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:06,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:06,687 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-23 21:29:06,688 INFO L343 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-11-23 21:29:06,688 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 158 treesize of output 184 [2019-11-23 21:29:06,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:06,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:06,908 INFO L496 ElimStorePlain]: Start of recursive call 4: 21 dim-0 vars, End of recursive call: 21 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:07,734 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 577 DAG size of output: 44 [2019-11-23 21:29:07,735 INFO L567 ElimStorePlain]: treesize reduction 18185, result has 0.7 percent of original size [2019-11-23 21:29:07,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:29:07,736 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:236, output treesize:109 [2019-11-23 21:29:07,795 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_40|], 20=[|v_#memory_$Pointer$.base_52|]} [2019-11-23 21:29:07,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:07,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 33 [2019-11-23 21:29:07,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:07,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:08,099 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-11-23 21:29:08,100 INFO L343 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-23 21:29:08,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 229 [2019-11-23 21:29:08,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:08,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:08,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:08,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:08,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:08,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:08,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-11-23 21:29:08,269 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-11-23 21:29:08,270 INFO L567 ElimStorePlain]: treesize reduction 3649, result has 4.0 percent of original size [2019-11-23 21:29:08,271 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:29:08,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:264, output treesize:154 [2019-11-23 21:29:08,335 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-11-23 21:29:08,339 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 42 treesize of output 18 [2019-11-23 21:29:08,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:08,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:08,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:08,388 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 139 treesize of output 116 [2019-11-23 21:29:08,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:08,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:08,409 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:29:08,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:08,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:169, output treesize:4 [2019-11-23 21:29:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:08,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:08,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-23 21:29:08,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586061506] [2019-11-23 21:29:08,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:29:08,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:29:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:29:08,435 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2019-11-23 21:29:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:09,431 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-23 21:29:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:29:09,431 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-11-23 21:29:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:09,432 INFO L225 Difference]: With dead ends: 131 [2019-11-23 21:29:09,432 INFO L226 Difference]: Without dead ends: 129 [2019-11-23 21:29:09,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2019-11-23 21:29:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-23 21:29:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-11-23 21:29:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-23 21:29:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-11-23 21:29:09,439 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 41 [2019-11-23 21:29:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:09,440 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-11-23 21:29:09,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:29:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-11-23 21:29:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 21:29:09,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:09,441 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:09,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:09,644 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1699655007, now seen corresponding path program 1 times [2019-11-23 21:29:09,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:09,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063158027] [2019-11-23 21:29:09,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:09,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063158027] [2019-11-23 21:29:09,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141901801] [2019-11-23 21:29:09,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -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:29:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:29:10,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-23 21:29:10,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:29:10,041 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:29:10,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-23 21:29:10,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,082 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:29:10,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,135 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.7 percent of original size [2019-11-23 21:29:10,142 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 27 treesize of output 15 [2019-11-23 21:29:10,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,164 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 27 treesize of output 15 [2019-11-23 21:29:10,164 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,181 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:29:10,181 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:46 [2019-11-23 21:29:10,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:10,232 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 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:10,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:10,257 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 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:29:10,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-23 21:29:10,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,331 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 21:29:10,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,446 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-23 21:29:10,447 INFO L567 ElimStorePlain]: treesize reduction 40, result has 79.8 percent of original size [2019-11-23 21:29:10,454 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 62 treesize of output 32 [2019-11-23 21:29:10,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,536 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 4 case distinctions, treesize of input 91 treesize of output 100 [2019-11-23 21:29:10,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:10,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:10,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:10,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:10,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:10,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:10,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:10,540 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,642 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-23 21:29:10,642 INFO L567 ElimStorePlain]: treesize reduction 256, result has 25.1 percent of original size [2019-11-23 21:29:10,643 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:29:10,643 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:152, output treesize:86 [2019-11-23 21:29:10,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:10,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,738 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 71 [2019-11-23 21:29:10,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,841 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-11-23 21:29:10,842 INFO L567 ElimStorePlain]: treesize reduction 52, result has 66.9 percent of original size [2019-11-23 21:29:10,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:10,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-23 21:29:10,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:10,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:86 [2019-11-23 21:29:10,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:10,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-23 21:29:10,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:11,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:11,210 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-23 21:29:11,211 INFO L343 Elim1Store]: treesize reduction 19, result has 87.2 percent of original size [2019-11-23 21:29:11,211 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 216 treesize of output 206 [2019-11-23 21:29:11,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,346 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:29:11,555 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-11-23 21:29:11,556 INFO L567 ElimStorePlain]: treesize reduction 111, result has 47.6 percent of original size [2019-11-23 21:29:11,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:11,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2019-11-23 21:29:11,565 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:11,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:11,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:11,611 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:239, output treesize:96 [2019-11-23 21:29:11,685 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_46|], 19=[|v_#memory_$Pointer$.base_58|]} [2019-11-23 21:29:11,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:29:11,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 47 [2019-11-23 21:29:11,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:11,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:11,973 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-23 21:29:11,974 INFO L343 Elim1Store]: treesize reduction 62, result has 72.4 percent of original size [2019-11-23 21:29:11,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 201 treesize of output 228 [2019-11-23 21:29:11,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:12,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:12,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:29:12,143 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-23 21:29:12,144 INFO L567 ElimStorePlain]: treesize reduction 3627, result has 4.0 percent of original size [2019-11-23 21:29:12,145 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:29:12,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:263, output treesize:153 [2019-11-23 21:29:12,213 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 29=[|#memory_$Pointer$.base|]} [2019-11-23 21:29:12,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:12,221 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2019-11-23 21:29:12,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:12,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:12,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:29:12,282 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 131 treesize of output 108 [2019-11-23 21:29:12,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:12,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:29:12,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:29:12,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:29:12,312 INFO L567 ElimStorePlain]: treesize reduction 261, result has 3.3 percent of original size [2019-11-23 21:29:12,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:29:12,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:184, output treesize:4 [2019-11-23 21:29:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:29:12,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:29:12,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-11-23 21:29:12,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713358576] [2019-11-23 21:29:12,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 21:29:12,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:29:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 21:29:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:29:12,338 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 16 states. [2019-11-23 21:29:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:29:13,120 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-23 21:29:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:29:13,120 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-11-23 21:29:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:29:13,121 INFO L225 Difference]: With dead ends: 129 [2019-11-23 21:29:13,121 INFO L226 Difference]: Without dead ends: 127 [2019-11-23 21:29:13,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:29:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-23 21:29:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-11-23 21:29:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-23 21:29:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-11-23 21:29:13,131 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 44 [2019-11-23 21:29:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:29:13,131 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-11-23 21:29:13,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 21:29:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-11-23 21:29:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 21:29:13,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:29:13,132 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:29:13,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:29:13,336 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:29:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:29:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1057023877, now seen corresponding path program 1 times [2019-11-23 21:29:13,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:29:13,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114852238] [2019-11-23 21:29:13,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:29:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 21:29:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 21:29:13,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 21:29:13,452 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 21:29:13,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:29:13 BoogieIcfgContainer [2019-11-23 21:29:13,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:29:13,544 INFO L168 Benchmark]: Toolchain (without parser) took 25425.69 ms. Allocated memory was 140.0 MB in the beginning and 404.8 MB in the end (delta: 264.8 MB). Free memory was 103.0 MB in the beginning and 107.2 MB in the end (delta: -4.2 MB). Peak memory consumption was 260.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:29:13,544 INFO L168 Benchmark]: CDTParser took 1.56 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 21:29:13,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.33 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 102.8 MB in the beginning and 169.3 MB in the end (delta: -66.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:29:13,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.00 ms. Allocated memory is still 203.4 MB. Free memory was 169.3 MB in the beginning and 167.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:29:13,548 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 203.4 MB. Free memory was 167.3 MB in the beginning and 164.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:29:13,548 INFO L168 Benchmark]: RCFGBuilder took 584.88 ms. Allocated memory is still 203.4 MB. Free memory was 164.7 MB in the beginning and 132.8 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:29:13,549 INFO L168 Benchmark]: TraceAbstraction took 24082.07 ms. Allocated memory was 203.4 MB in the beginning and 404.8 MB in the end (delta: 201.3 MB). Free memory was 132.1 MB in the beginning and 107.2 MB in the end (delta: 24.9 MB). Peak memory consumption was 226.3 MB. Max. memory is 7.1 GB. [2019-11-23 21:29:13,553 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.56 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 659.33 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 102.8 MB in the beginning and 169.3 MB in the end (delta: -66.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.00 ms. Allocated memory is still 203.4 MB. Free memory was 169.3 MB in the beginning and 167.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 203.4 MB. Free memory was 167.3 MB in the beginning and 164.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 584.88 ms. Allocated memory is still 203.4 MB. Free memory was 164.7 MB in the beginning and 132.8 MB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24082.07 ms. Allocated memory was 203.4 MB in the beginning and 404.8 MB in the end (delta: 201.3 MB). Free memory was 132.1 MB in the beginning and 107.2 MB in the end (delta: 24.9 MB). Peak memory consumption was 226.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND FALSE !(status == 1) [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) [L1018] COND FALSE !(status == 1) [L1023] COND FALSE !(status == 2) [L1029] COND TRUE status == 3 [L1031] COND FALSE !(!(head != ((void*)0))) [L1032] EXPR head->next [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 14 error locations. Result: UNSAFE, OverallTime: 24.0s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1403 SDtfs, 1526 SDslu, 4780 SDs, 0 SdLazy, 2816 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 298 SyntacticMatches, 13 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 360 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 824 ConstructedInterpolants, 141 QuantifiedInterpolants, 982205 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1117 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 87/337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...