/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:33:09,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:33:09,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:33:09,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:33:09,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:33:09,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:33:09,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:33:09,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:33:09,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:33:09,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:33:09,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:33:09,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:33:09,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:33:09,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:33:09,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:33:09,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:33:09,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:33:09,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:33:09,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:33:09,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:33:09,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:33:09,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:33:09,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:33:09,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:33:09,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:33:09,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:33:09,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:33:09,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:33:09,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:33:09,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:33:09,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:33:09,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:33:09,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:33:09,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:33:09,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:33:09,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:33:09,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:33:09,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:33:09,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:33:09,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:33:09,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:33:09,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 00:33:09,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:33:09,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:33:09,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:33:09,188 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:33:09,188 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:33:09,188 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:33:09,189 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:33:09,189 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:33:09,189 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:33:09,189 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:33:09,189 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:33:09,189 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:33:09,190 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:33:09,190 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:33:09,190 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:33:09,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:33:09,191 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:33:09,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:33:09,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:33:09,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:33:09,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:33:09,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:33:09,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:33:09,192 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:33:09,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:33:09,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:33:09,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:33:09,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:33:09,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:33:09,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:33:09,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:33:09,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:33:09,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:33:09,195 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:33:09,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:33:09,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:33:09,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:33:09,195 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:33:09,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:33:09,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:33:09,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:33:09,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:33:09,524 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:33:09,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue-2.i [2019-11-24 00:33:09,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda391d1b/6e281424e5ea4a2f8de3606927f9d79b/FLAGe9f9883cd [2019-11-24 00:33:10,126 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:33:10,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-queue-2.i [2019-11-24 00:33:10,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda391d1b/6e281424e5ea4a2f8de3606927f9d79b/FLAGe9f9883cd [2019-11-24 00:33:10,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda391d1b/6e281424e5ea4a2f8de3606927f9d79b [2019-11-24 00:33:10,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:33:10,435 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:33:10,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:33:10,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:33:10,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:33:10,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:33:10" (1/1) ... [2019-11-24 00:33:10,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8f9aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:10, skipping insertion in model container [2019-11-24 00:33:10,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:33:10" (1/1) ... [2019-11-24 00:33:10,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:33:10,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:33:10,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:33:10,978 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:33:11,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:33:11,076 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:33:11,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11 WrapperNode [2019-11-24 00:33:11,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:33:11,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:33:11,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:33:11,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:33:11,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:33:11,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:33:11,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:33:11,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:33:11,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2019-11-24 00:33:11,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:33:11,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:33:11,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:33:11,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:33:11,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (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-24 00:33:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:33:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:33:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:33:11,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:33:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:33:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:33:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:33:11,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:33:12,023 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:33:12,024 INFO L284 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-24 00:33:12,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:33:12 BoogieIcfgContainer [2019-11-24 00:33:12,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:33:12,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:33:12,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:33:12,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:33:12,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:33:10" (1/3) ... [2019-11-24 00:33:12,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31820ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:33:12, skipping insertion in model container [2019-11-24 00:33:12,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (2/3) ... [2019-11-24 00:33:12,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31820ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:33:12, skipping insertion in model container [2019-11-24 00:33:12,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:33:12" (3/3) ... [2019-11-24 00:33:12,044 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2019-11-24 00:33:12,055 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:33:12,062 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-24 00:33:12,070 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-24 00:33:12,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:33:12,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:33:12,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:33:12,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:33:12,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:33:12,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:33:12,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:33:12,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:33:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-24 00:33:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-24 00:33:12,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:12,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-24 00:33:12,117 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-24 00:33:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 11175788, now seen corresponding path program 1 times [2019-11-24 00:33:12,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:12,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620339769] [2019-11-24 00:33:12,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:12,271 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-24 00:33:12,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620339769] [2019-11-24 00:33:12,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:12,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:33:12,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513434731] [2019-11-24 00:33:12,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:33:12,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:33:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:33:12,297 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2019-11-24 00:33:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:12,327 INFO L93 Difference]: Finished difference Result 151 states and 249 transitions. [2019-11-24 00:33:12,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:33:12,329 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-11-24 00:33:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:12,341 INFO L225 Difference]: With dead ends: 151 [2019-11-24 00:33:12,341 INFO L226 Difference]: Without dead ends: 74 [2019-11-24 00:33:12,345 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-24 00:33:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-24 00:33:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-24 00:33:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-24 00:33:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-11-24 00:33:12,387 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 4 [2019-11-24 00:33:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:12,387 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-11-24 00:33:12,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:33:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-11-24 00:33:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:33:12,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:12,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:33:12,389 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-24 00:33:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash 345023121, now seen corresponding path program 1 times [2019-11-24 00:33:12,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:12,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9470113] [2019-11-24 00:33:12,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:12,509 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-24 00:33:12,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9470113] [2019-11-24 00:33:12,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:12,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:33:12,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471035039] [2019-11-24 00:33:12,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:33:12,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:33:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:33:12,517 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 3 states. [2019-11-24 00:33:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:12,558 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-11-24 00:33:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:33:12,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-24 00:33:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:12,561 INFO L225 Difference]: With dead ends: 74 [2019-11-24 00:33:12,561 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:33:12,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 00:33:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:33:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:33:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:33:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:33:12,588 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 5 [2019-11-24 00:33:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:12,588 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:33:12,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:33:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:33:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 00:33:12,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:12,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:12,590 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-24 00:33:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash 854864981, now seen corresponding path program 1 times [2019-11-24 00:33:12,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084684262] [2019-11-24 00:33:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:12,700 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-24 00:33:12,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084684262] [2019-11-24 00:33:12,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:12,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:33:12,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917769231] [2019-11-24 00:33:12,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:33:12,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:12,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:33:12,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:33:12,702 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-11-24 00:33:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:12,759 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-24 00:33:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:33:12,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 00:33:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:12,764 INFO L225 Difference]: With dead ends: 64 [2019-11-24 00:33:12,764 INFO L226 Difference]: Without dead ends: 62 [2019-11-24 00:33:12,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 00:33:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-24 00:33:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-24 00:33:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 00:33:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-24 00:33:12,781 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2019-11-24 00:33:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:12,782 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-24 00:33:12,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:33:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-24 00:33:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:33:12,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:12,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:12,783 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-24 00:33:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash 630794574, now seen corresponding path program 1 times [2019-11-24 00:33:12,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:12,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365898640] [2019-11-24 00:33:12,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:12,837 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-24 00:33:12,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365898640] [2019-11-24 00:33:12,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:12,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:33:12,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492176876] [2019-11-24 00:33:12,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:33:12,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:33:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:33:12,839 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 3 states. [2019-11-24 00:33:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:12,903 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-24 00:33:12,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:33:12,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 00:33:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:12,904 INFO L225 Difference]: With dead ends: 130 [2019-11-24 00:33:12,904 INFO L226 Difference]: Without dead ends: 78 [2019-11-24 00:33:12,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 00:33:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-24 00:33:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2019-11-24 00:33:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 00:33:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-11-24 00:33:12,913 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 11 [2019-11-24 00:33:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:12,914 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-11-24 00:33:12,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:33:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-11-24 00:33:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 00:33:12,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:12,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:12,915 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-24 00:33:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:12,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2089957788, now seen corresponding path program 1 times [2019-11-24 00:33:12,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:12,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585536331] [2019-11-24 00:33:12,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:12,962 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-24 00:33:12,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585536331] [2019-11-24 00:33:12,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:33:12,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:33:12,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594464873] [2019-11-24 00:33:12,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:33:12,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:33:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:33:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:33:12,964 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 4 states. [2019-11-24 00:33:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:33:13,052 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-24 00:33:13,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:33:13,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 00:33:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:33:13,054 INFO L225 Difference]: With dead ends: 78 [2019-11-24 00:33:13,054 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 00:33:13,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 00:33:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 00:33:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-24 00:33:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 00:33:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-24 00:33:13,061 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2019-11-24 00:33:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:33:13,061 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-24 00:33:13,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:33:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-24 00:33:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:33:13,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:33:13,062 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:33:13,063 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-24 00:33:13,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:33:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1536867569, now seen corresponding path program 1 times [2019-11-24 00:33:13,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:33:13,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512365144] [2019-11-24 00:33:13,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:33:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:13,146 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-24 00:33:13,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512365144] [2019-11-24 00:33:13,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985594625] [2019-11-24 00:33:13,147 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-24 00:33:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:33:13,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-24 00:33:13,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:33:13,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:13,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-24 00:33:13,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:13,349 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-11-24 00:33:13,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:33:13,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2019-11-24 00:33:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:13,408 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 0 case distinctions, treesize of input 346 treesize of output 342 [2019-11-24 00:33:13,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:13,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:13,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:13,436 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 1 case distinctions, treesize of input 348 treesize of output 350 [2019-11-24 00:33:13,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:13,529 INFO L567 ElimStorePlain]: treesize reduction 337, result has 50.0 percent of original size [2019-11-24 00:33:13,533 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_43|], 10=[|v_#memory_$Pointer$.base_43|]} [2019-11-24 00:33:13,540 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:13,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:13,554 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_43| vanished before elimination [2019-11-24 00:33:13,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:13,604 INFO L343 Elim1Store]: treesize reduction 73, result has 29.1 percent of original size [2019-11-24 00:33:13,605 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 2 case distinctions, treesize of input 43 treesize of output 37 [2019-11-24 00:33:13,605 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:13,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:13,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:13,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-24 00:33:13,627 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:695, output treesize:54 [2019-11-24 00:33:13,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:13,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:15,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:15,780 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-24 00:33:15,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:15,797 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-24 00:33:15,798 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-24 00:33:15,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-24 00:33:15,804 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-24 00:33:15,804 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:33:15,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:15,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:15,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:15,878 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_9, v_prenex_10, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_44|, v_prenex_17, v_prenex_16], 2=[v_prenex_13, |v_#memory_$Pointer$.base_44|, v_prenex_6], 7=[|#memory_$Pointer$.base|], 10=[v_prenex_8, v_prenex_3, v_prenex_15]} [2019-11-24 00:33:15,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:15,923 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:33:16,112 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-24 00:33:16,113 INFO L343 Elim1Store]: treesize reduction 344, result has 32.3 percent of original size [2019-11-24 00:33:16,114 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 3 case distinctions, treesize of input 355 treesize of output 353 [2019-11-24 00:33:16,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:31,186 WARN L192 SmtUtils]: Spent 15.07 s on a formula simplification. DAG size of input: 203 DAG size of output: 203 [2019-11-24 00:33:31,187 INFO L567 ElimStorePlain]: treesize reduction 9, result has 99.3 percent of original size [2019-11-24 00:33:31,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:31,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:31,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 370 [2019-11-24 00:33:31,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:33:31,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:31,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:31,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:31,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:31,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:37,090 WARN L192 SmtUtils]: Spent 5.75 s on a formula simplification. DAG size of input: 202 DAG size of output: 171 [2019-11-24 00:33:37,091 INFO L567 ElimStorePlain]: treesize reduction 362, result has 74.2 percent of original size [2019-11-24 00:33:37,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:37,425 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-24 00:33:37,566 INFO L237 Elim1Store]: Index analysis took 408 ms [2019-11-24 00:33:37,825 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-24 00:33:37,826 INFO L343 Elim1Store]: treesize reduction 344, result has 32.3 percent of original size [2019-11-24 00:33:37,826 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 3 case distinctions, treesize of input 352 treesize of output 350 [2019-11-24 00:33:37,827 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:43,111 WARN L192 SmtUtils]: Spent 5.28 s on a formula simplification that was a NOOP. DAG size: 187 [2019-11-24 00:33:43,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:43,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:33:43,342 INFO L237 Elim1Store]: Index analysis took 165 ms [2019-11-24 00:33:43,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:43,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 370 [2019-11-24 00:33:43,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:43,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:43,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:33:43,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:33:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:43,471 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:48,564 WARN L192 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 193 DAG size of output: 155 [2019-11-24 00:33:48,565 INFO L567 ElimStorePlain]: treesize reduction 638, result has 57.8 percent of original size [2019-11-24 00:33:48,573 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:49,314 WARN L192 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-11-24 00:33:49,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:49,315 INFO L464 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2019-11-24 00:33:49,322 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:33:49,754 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-24 00:33:49,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:49,762 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:33:49,970 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-24 00:33:49,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:49,977 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:33:50,107 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-11-24 00:33:50,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:33:50,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 619 treesize of output 611 [2019-11-24 00:33:50,129 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:50,795 WARN L192 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 125 [2019-11-24 00:33:50,796 INFO L567 ElimStorePlain]: treesize reduction 549, result has 47.3 percent of original size [2019-11-24 00:33:50,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11789 treesize of output 11725 [2019-11-24 00:33:50,827 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:52,052 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 250 DAG size of output: 125 [2019-11-24 00:33:52,053 INFO L567 ElimStorePlain]: treesize reduction 11558, result has 3.5 percent of original size [2019-11-24 00:33:52,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70909 treesize of output 70397 [2019-11-24 00:33:52,126 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:54,155 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 383 DAG size of output: 128 [2019-11-24 00:33:54,157 INFO L567 ElimStorePlain]: treesize reduction 69548, result has 0.5 percent of original size [2019-11-24 00:33:54,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 980 treesize of output 976 [2019-11-24 00:33:54,181 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-24 00:33:55,124 WARN L192 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 129 [2019-11-24 00:33:55,125 INFO L567 ElimStorePlain]: treesize reduction 891, result has 24.0 percent of original size [2019-11-24 00:33:55,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:55,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:55,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 00:33:55,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:33:55,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:33:55,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 13 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-11-24 00:33:55,146 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 25 variables, input treesize:1213, output treesize:255 [2019-11-24 00:33:55,267 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-24 00:33:55,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [190108720] [2019-11-24 00:33:55,292 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-24 00:33:55,292 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:33:55,298 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:33:55,303 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:33:55,304 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:33:55,935 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 00:33:56,944 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-11-24 00:34:05,589 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| |ULTIMATE.start_main_#t~malloc2.base|) 12) [2019-11-24 00:34:12,902 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| |ULTIMATE.start_main_#t~malloc2.base|) 12) [2019-11-24 00:34:14,908 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| |ULTIMATE.start_main_#t~malloc2.base|) 12) [2019-11-24 00:34:19,952 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| |ULTIMATE.start_main_#t~malloc2.base|) 12) [2019-11-24 00:34:21,962 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| |ULTIMATE.start_main_#t~malloc2.base|) 12) [2019-11-24 00:34:27,277 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| |ULTIMATE.start_main_#t~malloc2.base|) 12) [2019-11-24 00:34:29,281 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| |ULTIMATE.start_main_#t~malloc2.base|) 12)