/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-token-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:34:05,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:34:05,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:34:05,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:34:05,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:34:05,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:34:05,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:34:05,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:34:05,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:34:05,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:34:05,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:34:05,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:34:05,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:34:05,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:34:05,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:34:05,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:34:05,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:34:05,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:34:05,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:34:05,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:34:05,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:34:05,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:34:05,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:34:05,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:34:05,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:34:05,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:34:05,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:34:05,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:34:05,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:34:05,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:34:05,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:34:05,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:34:05,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:34:05,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:34:05,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:34:05,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:34:05,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:34:05,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:34:05,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:34:05,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:34:05,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:34:05,232 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:34:05,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:34:05,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:34:05,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:34:05,252 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:34:05,253 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:34:05,253 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:34:05,253 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:34:05,253 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:34:05,253 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:34:05,254 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:34:05,254 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:34:05,254 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:34:05,254 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:34:05,254 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:34:05,255 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:34:05,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:34:05,257 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:34:05,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:34:05,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:34:05,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:34:05,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:34:05,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:34:05,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:34:05,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:34:05,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:34:05,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:34:05,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:34:05,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:34:05,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:34:05,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:34:05,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:34:05,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:34:05,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:34:05,261 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:34:05,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:34:05,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:34:05,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:34:05,263 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:34:05,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:34:05,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:34:05,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:34:05,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:34:05,625 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:34:05,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-11-24 00:34:05,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754940a73/e3a32a490449492e96478318bbf72db0/FLAGa2aa73e28 [2019-11-24 00:34:06,188 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:34:06,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-1.i [2019-11-24 00:34:06,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754940a73/e3a32a490449492e96478318bbf72db0/FLAGa2aa73e28 [2019-11-24 00:34:06,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754940a73/e3a32a490449492e96478318bbf72db0 [2019-11-24 00:34:06,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:34:06,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:34:06,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:06,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:34:06,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:34:06,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:06" (1/1) ... [2019-11-24 00:34:06,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513e09ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:06, skipping insertion in model container [2019-11-24 00:34:06,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:34:06" (1/1) ... [2019-11-24 00:34:06,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:34:06,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:34:07,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:07,106 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:34:07,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:34:07,250 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:34:07,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07 WrapperNode [2019-11-24 00:34:07,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:34:07,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:07,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:34:07,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:34:07,261 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:34:07" (1/1) ... [2019-11-24 00:34:07,297 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:34:07" (1/1) ... [2019-11-24 00:34:07,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:34:07,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:34:07,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:34:07,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:34:07,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (1/1) ... [2019-11-24 00:34:07,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:34:07,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:34:07,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:34:07,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:34:07,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (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:34:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:34:07,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:34:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:34:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:34:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:34:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:34:07,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:34:07,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:34:08,020 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:34:08,021 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-24 00:34:08,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:08 BoogieIcfgContainer [2019-11-24 00:34:08,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:34:08,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:34:08,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:34:08,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:34:08,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:34:06" (1/3) ... [2019-11-24 00:34:08,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8f7613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:08, skipping insertion in model container [2019-11-24 00:34:08,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:34:07" (2/3) ... [2019-11-24 00:34:08,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8f7613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:34:08, skipping insertion in model container [2019-11-24 00:34:08,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:34:08" (3/3) ... [2019-11-24 00:34:08,039 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2019-11-24 00:34:08,050 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:34:08,059 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 00:34:08,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 00:34:08,097 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:34:08,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:34:08,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:34:08,098 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:34:08,098 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:34:08,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:34:08,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:34:08,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:34:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-11-24 00:34:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:34:08,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:08,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:34:08,126 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash 176456257, now seen corresponding path program 1 times [2019-11-24 00:34:08,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:08,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780945200] [2019-11-24 00:34:08,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:08,309 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:34:08,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780945200] [2019-11-24 00:34:08,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:08,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:34:08,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089716409] [2019-11-24 00:34:08,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:34:08,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:34:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:34:08,338 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-11-24 00:34:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:08,366 INFO L93 Difference]: Finished difference Result 81 states and 127 transitions. [2019-11-24 00:34:08,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:34:08,367 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-24 00:34:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:08,375 INFO L225 Difference]: With dead ends: 81 [2019-11-24 00:34:08,375 INFO L226 Difference]: Without dead ends: 38 [2019-11-24 00:34:08,379 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:34:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-24 00:34:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-24 00:34:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 00:34:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-11-24 00:34:08,412 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 5 [2019-11-24 00:34:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:08,412 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-11-24 00:34:08,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:34:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-11-24 00:34:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 00:34:08,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:08,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 00:34:08,413 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash 175689636, now seen corresponding path program 1 times [2019-11-24 00:34:08,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:08,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353078467] [2019-11-24 00:34:08,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:08,557 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:34:08,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353078467] [2019-11-24 00:34:08,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:08,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:08,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541740618] [2019-11-24 00:34:08,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:34:08,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:34:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:34:08,563 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 4 states. [2019-11-24 00:34:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:08,674 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-24 00:34:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:34:08,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-11-24 00:34:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:08,676 INFO L225 Difference]: With dead ends: 38 [2019-11-24 00:34:08,677 INFO L226 Difference]: Without dead ends: 36 [2019-11-24 00:34:08,678 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:34:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-24 00:34:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-24 00:34:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-24 00:34:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-24 00:34:08,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2019-11-24 00:34:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:08,685 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-24 00:34:08,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:34:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-24 00:34:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 00:34:08,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:08,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 00:34:08,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1151367906, now seen corresponding path program 1 times [2019-11-24 00:34:08,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:08,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486702410] [2019-11-24 00:34:08,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:08,787 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:34:08,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486702410] [2019-11-24 00:34:08,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:08,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:34:08,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455128231] [2019-11-24 00:34:08,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:34:08,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:34:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:34:08,792 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 4 states. [2019-11-24 00:34:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:08,895 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-24 00:34:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:34:08,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 00:34:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:08,898 INFO L225 Difference]: With dead ends: 62 [2019-11-24 00:34:08,898 INFO L226 Difference]: Without dead ends: 60 [2019-11-24 00:34:08,899 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:34:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-24 00:34:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2019-11-24 00:34:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-24 00:34:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-11-24 00:34:08,906 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 6 [2019-11-24 00:34:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:08,906 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-11-24 00:34:08,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:34:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-11-24 00:34:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:34:08,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:08,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:08,908 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 855581616, now seen corresponding path program 1 times [2019-11-24 00:34:08,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:08,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739292032] [2019-11-24 00:34:08,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:08,967 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:34:08,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739292032] [2019-11-24 00:34:08,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:08,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:34:08,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647543074] [2019-11-24 00:34:08,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:34:08,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:34:08,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:34:08,971 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 5 states. [2019-11-24 00:34:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,129 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-24 00:34:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:34:09,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 00:34:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,132 INFO L225 Difference]: With dead ends: 34 [2019-11-24 00:34:09,133 INFO L226 Difference]: Without dead ends: 32 [2019-11-24 00:34:09,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:34:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-24 00:34:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-24 00:34:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-24 00:34:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-11-24 00:34:09,146 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2019-11-24 00:34:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,148 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-11-24 00:34:09,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:34:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-11-24 00:34:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 00:34:09,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,153 INFO L82 PathProgramCache]: Analyzing trace with hash 855619352, now seen corresponding path program 1 times [2019-11-24 00:34:09,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494031434] [2019-11-24 00:34:09,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,388 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:34:09,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494031434] [2019-11-24 00:34:09,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:34:09,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310686504] [2019-11-24 00:34:09,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:34:09,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:34:09,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:34:09,392 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states. [2019-11-24 00:34:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,558 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-11-24 00:34:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:34:09,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-24 00:34:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,559 INFO L225 Difference]: With dead ends: 67 [2019-11-24 00:34:09,559 INFO L226 Difference]: Without dead ends: 43 [2019-11-24 00:34:09,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:34:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-24 00:34:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-24 00:34:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-24 00:34:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-24 00:34:09,567 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2019-11-24 00:34:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,567 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-24 00:34:09,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:34:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-24 00:34:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:34:09,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,569 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1714666408, now seen corresponding path program 1 times [2019-11-24 00:34:09,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962970735] [2019-11-24 00:34:09,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:09,739 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:34:09,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962970735] [2019-11-24 00:34:09,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:34:09,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:34:09,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84431147] [2019-11-24 00:34:09,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:34:09,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:09,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:34:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:34:09,742 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-24 00:34:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:09,918 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-24 00:34:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:34:09,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 00:34:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:09,920 INFO L225 Difference]: With dead ends: 49 [2019-11-24 00:34:09,920 INFO L226 Difference]: Without dead ends: 47 [2019-11-24 00:34:09,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 00:34:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-24 00:34:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-24 00:34:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-24 00:34:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-24 00:34:09,927 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-11-24 00:34:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:09,928 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-24 00:34:09,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:34:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-24 00:34:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:34:09,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:09,929 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:34:09,929 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2050025663, now seen corresponding path program 1 times [2019-11-24 00:34:09,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:09,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002836277] [2019-11-24 00:34:09,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:10,083 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:34:10,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002836277] [2019-11-24 00:34:10,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058971463] [2019-11-24 00:34:10,084 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:34:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:10,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-24 00:34:10,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:10,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:10,271 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:34:10,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:10,317 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-11-24 00:34:10,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-24 00:34:10,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:10,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:10,341 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-24 00:34:10,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2019-11-24 00:34:10,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:10,629 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-11-24 00:34:10,629 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-24 00:34:10,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 161 [2019-11-24 00:34:10,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:10,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:10,669 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 112 treesize of output 134 [2019-11-24 00:34:10,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:10,983 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-24 00:34:10,985 INFO L567 ElimStorePlain]: treesize reduction 30, result has 88.7 percent of original size [2019-11-24 00:34:11,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:11,017 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:11,030 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,133 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-24 00:34:11,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:11,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:11,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2019-11-24 00:34:11,154 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:11,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2019-11-24 00:34:11,183 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:11,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2019-11-24 00:34:11,283 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2019-11-24 00:34:11,298 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:11,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2019-11-24 00:34:11,397 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2019-11-24 00:34:11,409 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:11,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 00:34:11,463 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:227, output treesize:93 [2019-11-24 00:34:11,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:11,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:11,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:11,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:11,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:11,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:11,618 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 186 treesize of output 196 [2019-11-24 00:34:11,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,768 INFO L237 Elim1Store]: Index analysis took 124 ms [2019-11-24 00:34:11,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:11,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 188 treesize of output 220 [2019-11-24 00:34:11,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:11,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:11,884 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 183 treesize of output 193 [2019-11-24 00:34:11,885 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:12,558 WARN L192 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2019-11-24 00:34:12,559 INFO L567 ElimStorePlain]: treesize reduction 187, result has 65.4 percent of original size [2019-11-24 00:34:12,563 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_int_37|], 6=[|v_#memory_$Pointer$.base_25|, |v_#memory_int_38|, |v_#memory_$Pointer$.offset_23|], 28=[|v_#memory_int_40|]} [2019-11-24 00:34:12,573 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:12,599 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:12,863 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-24 00:34:12,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:12,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:12,881 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:12,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:12,891 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,043 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-24 00:34:13,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:13,049 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:34:13,056 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:13,162 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-24 00:34:13,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:13,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:13,170 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:13,182 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:13,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:13,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:13,312 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 78 treesize of output 65 [2019-11-24 00:34:13,313 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:13,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:13,334 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 78 treesize of output 65 [2019-11-24 00:34:13,335 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:13,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-24 00:34:13,384 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:558, output treesize:87 [2019-11-24 00:34:13,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-24 00:34:13,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:13,475 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-24 00:34:13,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-11-24 00:34:13,479 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:34:13,480 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:34:13,501 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_25|, |v_#memory_int_38|, |v_#memory_$Pointer$.offset_23|], 3=[|v_#memory_int_37|]} [2019-11-24 00:34:13,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,569 INFO L567 ElimStorePlain]: treesize reduction 70, result has 58.1 percent of original size [2019-11-24 00:34:13,573 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-24 00:34:13,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:13,594 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:13,668 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.3 percent of original size [2019-11-24 00:34:13,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:13,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:13,675 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:13,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:13,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:13,719 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:157, output treesize:116 [2019-11-24 00:34:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:14,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:34:14,193 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |v_#memory_int_35|], 10=[|v_#memory_int_36|]} [2019-11-24 00:34:14,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:14,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:14,245 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:14,455 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2019-11-24 00:34:14,455 INFO L567 ElimStorePlain]: treesize reduction 571, result has 15.2 percent of original size [2019-11-24 00:34:14,465 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:14,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:14,507 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:14,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:14,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-24 00:34:14,532 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:875, output treesize:108 [2019-11-24 00:34:15,131 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-24 00:34:15,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 00:34:15,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2019-11-24 00:34:15,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095725239] [2019-11-24 00:34:15,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:34:15,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:34:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:34:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-24 00:34:15,133 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2019-11-24 00:34:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:34:23,608 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-24 00:34:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:34:23,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 00:34:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:34:23,612 INFO L225 Difference]: With dead ends: 57 [2019-11-24 00:34:23,612 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 00:34:23,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-24 00:34:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 00:34:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-24 00:34:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-24 00:34:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-24 00:34:23,619 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 15 [2019-11-24 00:34:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:34:23,619 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-24 00:34:23,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:34:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-24 00:34:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 00:34:23,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:34:23,621 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-24 00:34:23,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:34:23,822 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:34:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:34:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash 942499841, now seen corresponding path program 1 times [2019-11-24 00:34:23,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:34:23,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95855410] [2019-11-24 00:34:23,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:34:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:24,035 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:34:24,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95855410] [2019-11-24 00:34:24,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36399407] [2019-11-24 00:34:24,036 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-24 00:34:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:34:24,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-24 00:34:24,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:34:24,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:24,128 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:34:24,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:24,171 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-11-24 00:34:24,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-24 00:34:24,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:24,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:24,193 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-24 00:34:24,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2019-11-24 00:34:24,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:24,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:24,319 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 204 treesize of output 226 [2019-11-24 00:34:24,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:24,445 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-24 00:34:24,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 206 treesize of output 253 [2019-11-24 00:34:24,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:24,936 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-24 00:34:24,937 INFO L567 ElimStorePlain]: treesize reduction 38, result has 91.5 percent of original size [2019-11-24 00:34:24,939 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_48|, |v_#memory_int_44|, |v_#memory_int_45|, |v_#memory_$Pointer$.base_30|], 8=[|v_#memory_$Pointer$.offset_27|]} [2019-11-24 00:34:24,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:24,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 190 [2019-11-24 00:34:24,968 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:24,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:24,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 196 [2019-11-24 00:34:24,986 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,175 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-24 00:34:25,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:25,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2019-11-24 00:34:25,214 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 181 [2019-11-24 00:34:25,226 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,364 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-24 00:34:25,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:25,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2019-11-24 00:34:25,424 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 171 [2019-11-24 00:34:25,449 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,577 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-24 00:34:25,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:25,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,584 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,590 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,701 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-24 00:34:25,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:25,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:25,742 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 1 case distinctions, treesize of input 112 treesize of output 85 [2019-11-24 00:34:25,743 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:34:25,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:25,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 91 [2019-11-24 00:34:25,785 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:25,968 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-24 00:34:25,969 INFO L567 ElimStorePlain]: treesize reduction 52, result has 70.6 percent of original size [2019-11-24 00:34:25,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 00:34:25,974 INFO L221 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:411, output treesize:119 [2019-11-24 00:34:26,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:26,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:26,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:34:26,074 INFO L392 ElimStorePlain]: Different costs {3=[|v_#valid_31|], 6=[v_prenex_12]} [2019-11-24 00:34:26,261 INFO L237 Elim1Store]: Index analysis took 116 ms [2019-11-24 00:34:26,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:26,272 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 432 treesize of output 442 [2019-11-24 00:34:26,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:44,450 WARN L192 SmtUtils]: Spent 18.18 s on a formula simplification that was a NOOP. DAG size: 208 [2019-11-24 00:34:44,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:48,716 INFO L237 Elim1Store]: Index analysis took 3758 ms [2019-11-24 00:34:48,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:48,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 434 treesize of output 466 [2019-11-24 00:34:48,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:34:48,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:34:48,866 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 429 treesize of output 439 [2019-11-24 00:34:48,867 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:19,551 WARN L192 SmtUtils]: Spent 30.68 s on a formula simplification. DAG size of input: 206 DAG size of output: 204 [2019-11-24 00:35:19,552 INFO L567 ElimStorePlain]: treesize reduction 4, result has 99.7 percent of original size [2019-11-24 00:35:19,559 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_29|, |v_#memory_int_46|, |v_#memory_int_47|], 4=[|v_#memory_$Pointer$.offset_28|, v_prenex_6, v_prenex_7], 5=[v_prenex_8], 7=[|v_#memory_int_49|], 9=[v_prenex_10], 11=[|v_#memory_$Pointer$.offset_26|], 16=[v_prenex_5], 25=[v_prenex_9]} [2019-11-24 00:35:19,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:35:19,571 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-24 00:35:31,281 WARN L192 SmtUtils]: Spent 11.71 s on a formula simplification that was a NOOP. DAG size: 193 [2019-11-24 00:35:31,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:31,290 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:35:43,130 WARN L192 SmtUtils]: Spent 11.84 s on a formula simplification that was a NOOP. DAG size: 189 [2019-11-24 00:35:43,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:43,138 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:35:54,717 WARN L192 SmtUtils]: Spent 11.58 s on a formula simplification that was a NOOP. DAG size: 186 [2019-11-24 00:35:54,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:35:54,736 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 234 treesize of output 225 [2019-11-24 00:35:54,737 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts.