/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/product-lines/elevator_spec3_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:43:32,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:43:32,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:43:32,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:43:32,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:43:32,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:43:32,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:43:32,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:43:32,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:43:32,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:43:32,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:43:32,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:43:32,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:43:32,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:43:32,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:43:32,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:43:32,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:43:32,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:43:32,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:43:32,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:43:32,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:43:32,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:43:32,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:43:32,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:43:32,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:43:32,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:43:32,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:43:32,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:43:32,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:43:32,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:43:32,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:43:32,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:43:32,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:43:32,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:43:32,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:43:32,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:43:32,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:43:32,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:43:32,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:43:32,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:43:32,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:43:32,336 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 04:43:32,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:43:32,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:43:32,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:43:32,358 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:43:32,359 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:43:32,359 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:43:32,359 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:43:32,360 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:43:32,360 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:43:32,360 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:43:32,361 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:43:32,361 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:43:32,362 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:43:32,362 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:43:32,362 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:43:32,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:43:32,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:43:32,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:43:32,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:43:32,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:43:32,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:43:32,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:43:32,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:43:32,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:43:32,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:43:32,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:43:32,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:43:32,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:43:32,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:43:32,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:43:32,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:43:32,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:43:32,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:43:32,367 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:43:32,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:43:32,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:43:32,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:43:32,367 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:43:32,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:43:32,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:43:32,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:43:32,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:43:32,678 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:43:32,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product03.cil.c [2019-11-24 04:43:32,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a5e0c8a/0b0bf34ff4444bd7a3619e5d9bbe7692/FLAG1b19b43b4 [2019-11-24 04:43:33,431 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:43:33,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product03.cil.c [2019-11-24 04:43:33,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a5e0c8a/0b0bf34ff4444bd7a3619e5d9bbe7692/FLAG1b19b43b4 [2019-11-24 04:43:33,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a5e0c8a/0b0bf34ff4444bd7a3619e5d9bbe7692 [2019-11-24 04:43:33,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:43:33,631 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:43:33,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:43:33,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:43:33,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:43:33,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:43:33" (1/1) ... [2019-11-24 04:43:33,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4822bd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:33, skipping insertion in model container [2019-11-24 04:43:33,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:43:33" (1/1) ... [2019-11-24 04:43:33,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:43:33,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:43:34,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:43:34,454 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:43:34,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:43:34,692 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:43:34,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34 WrapperNode [2019-11-24 04:43:34,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:43:34,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:43:34,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:43:34,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:43:34,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:34,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:43:35,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:43:35,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:43:35,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:43:35,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (1/1) ... [2019-11-24 04:43:35,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:43:35,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:43:35,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:43:35,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:43:35,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (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 04:43:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:43:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:43:35,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:43:35,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:44:28,718 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:44:28,718 INFO L284 CfgBuilder]: Removed 1257 assume(true) statements. [2019-11-24 04:44:28,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:44:28 BoogieIcfgContainer [2019-11-24 04:44:28,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:44:28,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:44:28,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:44:28,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:44:28,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:43:33" (1/3) ... [2019-11-24 04:44:28,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1f27ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:44:28, skipping insertion in model container [2019-11-24 04:44:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:43:34" (2/3) ... [2019-11-24 04:44:28,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1f27ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:44:28, skipping insertion in model container [2019-11-24 04:44:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:44:28" (3/3) ... [2019-11-24 04:44:28,728 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product03.cil.c [2019-11-24 04:44:28,736 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:44:28,744 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-24 04:44:28,754 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-24 04:44:28,786 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:44:28,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:44:28,787 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:44:28,787 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:44:28,787 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:44:28,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:44:28,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:44:28,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:44:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states. [2019-11-24 04:44:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:44:28,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:28,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:28,842 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1559632106, now seen corresponding path program 1 times [2019-11-24 04:44:28,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:28,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158665002] [2019-11-24 04:44:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:29,296 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 04:44:29,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158665002] [2019-11-24 04:44:29,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:29,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:29,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795855139] [2019-11-24 04:44:29,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:29,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:29,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:29,328 INFO L87 Difference]: Start difference. First operand 1898 states. Second operand 3 states. [2019-11-24 04:44:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:29,534 INFO L93 Difference]: Finished difference Result 3775 states and 7255 transitions. [2019-11-24 04:44:29,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:29,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 04:44:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:29,568 INFO L225 Difference]: With dead ends: 3775 [2019-11-24 04:44:29,568 INFO L226 Difference]: Without dead ends: 1887 [2019-11-24 04:44:29,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-11-24 04:44:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2019-11-24 04:44:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2019-11-24 04:44:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 3613 transitions. [2019-11-24 04:44:29,743 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 3613 transitions. Word has length 14 [2019-11-24 04:44:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:29,744 INFO L462 AbstractCegarLoop]: Abstraction has 1887 states and 3613 transitions. [2019-11-24 04:44:29,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 3613 transitions. [2019-11-24 04:44:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:44:29,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:29,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:29,752 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1407438404, now seen corresponding path program 1 times [2019-11-24 04:44:29,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:29,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424261155] [2019-11-24 04:44:29,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:29,909 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 04:44:29,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424261155] [2019-11-24 04:44:29,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:29,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:44:29,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84698539] [2019-11-24 04:44:29,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:44:29,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:44:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:44:29,915 INFO L87 Difference]: Start difference. First operand 1887 states and 3613 transitions. Second operand 4 states. [2019-11-24 04:44:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:31,478 INFO L93 Difference]: Finished difference Result 7120 states and 13580 transitions. [2019-11-24 04:44:31,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:44:31,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 04:44:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:31,511 INFO L225 Difference]: With dead ends: 7120 [2019-11-24 04:44:31,511 INFO L226 Difference]: Without dead ends: 5245 [2019-11-24 04:44:31,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:44:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5245 states. [2019-11-24 04:44:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5245 to 2505. [2019-11-24 04:44:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-11-24 04:44:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 4766 transitions. [2019-11-24 04:44:31,642 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 4766 transitions. Word has length 14 [2019-11-24 04:44:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:31,642 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 4766 transitions. [2019-11-24 04:44:31,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:44:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 4766 transitions. [2019-11-24 04:44:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:44:31,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:31,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:31,645 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1673037407, now seen corresponding path program 1 times [2019-11-24 04:44:31,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:31,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188055681] [2019-11-24 04:44:31,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:31,732 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 04:44:31,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188055681] [2019-11-24 04:44:31,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:31,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:31,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543796630] [2019-11-24 04:44:31,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:31,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:31,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:31,735 INFO L87 Difference]: Start difference. First operand 2505 states and 4766 transitions. Second operand 3 states. [2019-11-24 04:44:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:32,010 INFO L93 Difference]: Finished difference Result 6989 states and 13302 transitions. [2019-11-24 04:44:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:32,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 04:44:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:32,038 INFO L225 Difference]: With dead ends: 6989 [2019-11-24 04:44:32,038 INFO L226 Difference]: Without dead ends: 4489 [2019-11-24 04:44:32,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-11-24 04:44:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 2505. [2019-11-24 04:44:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-11-24 04:44:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 4762 transitions. [2019-11-24 04:44:34,526 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 4762 transitions. Word has length 15 [2019-11-24 04:44:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:34,527 INFO L462 AbstractCegarLoop]: Abstraction has 2505 states and 4762 transitions. [2019-11-24 04:44:34,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 4762 transitions. [2019-11-24 04:44:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:44:34,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:34,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:34,533 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:34,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1065378214, now seen corresponding path program 1 times [2019-11-24 04:44:34,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:34,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046222444] [2019-11-24 04:44:34,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:34,684 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 04:44:34,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046222444] [2019-11-24 04:44:34,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:34,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:44:34,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865113974] [2019-11-24 04:44:34,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:44:34,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:34,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:44:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:44:34,686 INFO L87 Difference]: Start difference. First operand 2505 states and 4762 transitions. Second operand 5 states. [2019-11-24 04:44:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:36,348 INFO L93 Difference]: Finished difference Result 10130 states and 19242 transitions. [2019-11-24 04:44:36,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:44:36,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 04:44:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:36,391 INFO L225 Difference]: With dead ends: 10130 [2019-11-24 04:44:36,391 INFO L226 Difference]: Without dead ends: 7637 [2019-11-24 04:44:36,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:44:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7637 states. [2019-11-24 04:44:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7637 to 3643. [2019-11-24 04:44:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-11-24 04:44:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 6873 transitions. [2019-11-24 04:44:36,573 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 6873 transitions. Word has length 16 [2019-11-24 04:44:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:36,573 INFO L462 AbstractCegarLoop]: Abstraction has 3643 states and 6873 transitions. [2019-11-24 04:44:36,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:44:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 6873 transitions. [2019-11-24 04:44:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:44:36,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:36,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:36,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1523496052, now seen corresponding path program 1 times [2019-11-24 04:44:36,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:36,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436051932] [2019-11-24 04:44:36,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:36,684 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 04:44:36,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436051932] [2019-11-24 04:44:36,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:36,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:44:36,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770153441] [2019-11-24 04:44:36,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:44:36,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:44:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:44:36,686 INFO L87 Difference]: Start difference. First operand 3643 states and 6873 transitions. Second operand 4 states. [2019-11-24 04:44:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:38,308 INFO L93 Difference]: Finished difference Result 11726 states and 22065 transitions. [2019-11-24 04:44:38,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:44:38,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 04:44:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:38,348 INFO L225 Difference]: With dead ends: 11726 [2019-11-24 04:44:38,348 INFO L226 Difference]: Without dead ends: 8095 [2019-11-24 04:44:38,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:44:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8095 states. [2019-11-24 04:44:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8095 to 4206. [2019-11-24 04:44:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4206 states. [2019-11-24 04:44:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 7887 transitions. [2019-11-24 04:44:38,556 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 7887 transitions. Word has length 18 [2019-11-24 04:44:38,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:38,557 INFO L462 AbstractCegarLoop]: Abstraction has 4206 states and 7887 transitions. [2019-11-24 04:44:38,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:44:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 7887 transitions. [2019-11-24 04:44:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:44:38,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:38,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:38,558 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:38,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:38,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1590610678, now seen corresponding path program 1 times [2019-11-24 04:44:38,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:38,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581753170] [2019-11-24 04:44:38,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:38,694 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 04:44:38,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581753170] [2019-11-24 04:44:38,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:38,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:44:38,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515651951] [2019-11-24 04:44:38,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:44:38,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:38,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:44:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:44:38,697 INFO L87 Difference]: Start difference. First operand 4206 states and 7887 transitions. Second operand 6 states. [2019-11-24 04:44:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:42,238 INFO L93 Difference]: Finished difference Result 16623 states and 31279 transitions. [2019-11-24 04:44:42,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:44:42,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-24 04:44:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:42,276 INFO L225 Difference]: With dead ends: 16623 [2019-11-24 04:44:42,276 INFO L226 Difference]: Without dead ends: 12696 [2019-11-24 04:44:42,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-24 04:44:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12696 states. [2019-11-24 04:44:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12696 to 6709. [2019-11-24 04:44:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6709 states. [2019-11-24 04:44:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6709 states to 6709 states and 12125 transitions. [2019-11-24 04:44:42,611 INFO L78 Accepts]: Start accepts. Automaton has 6709 states and 12125 transitions. Word has length 20 [2019-11-24 04:44:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:42,612 INFO L462 AbstractCegarLoop]: Abstraction has 6709 states and 12125 transitions. [2019-11-24 04:44:42,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:44:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 6709 states and 12125 transitions. [2019-11-24 04:44:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:44:42,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:42,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:42,617 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1584991651, now seen corresponding path program 1 times [2019-11-24 04:44:42,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:42,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884421456] [2019-11-24 04:44:42,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:42,727 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 04:44:42,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884421456] [2019-11-24 04:44:42,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:42,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:42,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747206228] [2019-11-24 04:44:42,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:42,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:42,729 INFO L87 Difference]: Start difference. First operand 6709 states and 12125 transitions. Second operand 3 states. [2019-11-24 04:44:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:43,143 INFO L93 Difference]: Finished difference Result 19162 states and 34673 transitions. [2019-11-24 04:44:43,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:43,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:44:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:43,170 INFO L225 Difference]: With dead ends: 19162 [2019-11-24 04:44:43,170 INFO L226 Difference]: Without dead ends: 12780 [2019-11-24 04:44:43,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12780 states. [2019-11-24 04:44:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12780 to 12702. [2019-11-24 04:44:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-11-24 04:44:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 22968 transitions. [2019-11-24 04:44:43,910 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 22968 transitions. Word has length 21 [2019-11-24 04:44:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:43,910 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 22968 transitions. [2019-11-24 04:44:43,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:44:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 22968 transitions. [2019-11-24 04:44:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:44:43,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:43,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:43,911 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1841551552, now seen corresponding path program 1 times [2019-11-24 04:44:43,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:43,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052048621] [2019-11-24 04:44:43,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:44,015 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 04:44:44,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052048621] [2019-11-24 04:44:44,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:44,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:44,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067050756] [2019-11-24 04:44:44,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:44:44,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:44,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:44:44,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:44:44,018 INFO L87 Difference]: Start difference. First operand 12702 states and 22968 transitions. Second operand 4 states. [2019-11-24 04:44:44,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:44,577 INFO L93 Difference]: Finished difference Result 30510 states and 55226 transitions. [2019-11-24 04:44:44,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:44:44,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-24 04:44:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:44,604 INFO L225 Difference]: With dead ends: 30510 [2019-11-24 04:44:44,604 INFO L226 Difference]: Without dead ends: 18452 [2019-11-24 04:44:44,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 04:44:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18452 states. [2019-11-24 04:44:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18452 to 18338. [2019-11-24 04:44:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18338 states. [2019-11-24 04:44:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18338 states to 18338 states and 33243 transitions. [2019-11-24 04:44:45,416 INFO L78 Accepts]: Start accepts. Automaton has 18338 states and 33243 transitions. Word has length 22 [2019-11-24 04:44:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:45,416 INFO L462 AbstractCegarLoop]: Abstraction has 18338 states and 33243 transitions. [2019-11-24 04:44:45,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:44:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 18338 states and 33243 transitions. [2019-11-24 04:44:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 04:44:45,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:45,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:45,419 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash -948987443, now seen corresponding path program 1 times [2019-11-24 04:44:45,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:45,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749619402] [2019-11-24 04:44:45,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:45,520 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 04:44:45,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749619402] [2019-11-24 04:44:45,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:45,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:44:45,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801929051] [2019-11-24 04:44:45,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:44:45,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:45,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:44:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:44:45,522 INFO L87 Difference]: Start difference. First operand 18338 states and 33243 transitions. Second operand 4 states. [2019-11-24 04:44:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:47,188 INFO L93 Difference]: Finished difference Result 35592 states and 65383 transitions. [2019-11-24 04:44:47,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:44:47,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-24 04:44:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:47,216 INFO L225 Difference]: With dead ends: 35592 [2019-11-24 04:44:47,216 INFO L226 Difference]: Without dead ends: 25180 [2019-11-24 04:44:47,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:44:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25180 states. [2019-11-24 04:44:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25180 to 18338. [2019-11-24 04:44:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18338 states. [2019-11-24 04:44:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18338 states to 18338 states and 33229 transitions. [2019-11-24 04:44:47,921 INFO L78 Accepts]: Start accepts. Automaton has 18338 states and 33229 transitions. Word has length 33 [2019-11-24 04:44:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:47,922 INFO L462 AbstractCegarLoop]: Abstraction has 18338 states and 33229 transitions. [2019-11-24 04:44:47,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:44:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 18338 states and 33229 transitions. [2019-11-24 04:44:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:44:47,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:47,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:47,925 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash 735863361, now seen corresponding path program 1 times [2019-11-24 04:44:47,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:47,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584493749] [2019-11-24 04:44:47,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:48,030 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 04:44:48,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584493749] [2019-11-24 04:44:48,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:48,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:44:48,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825332480] [2019-11-24 04:44:48,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:44:48,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:48,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:44:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:44:48,032 INFO L87 Difference]: Start difference. First operand 18338 states and 33229 transitions. Second operand 5 states. [2019-11-24 04:44:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:49,947 INFO L93 Difference]: Finished difference Result 37028 states and 68154 transitions. [2019-11-24 04:44:49,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:44:49,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-24 04:44:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:49,974 INFO L225 Difference]: With dead ends: 37028 [2019-11-24 04:44:49,974 INFO L226 Difference]: Without dead ends: 26604 [2019-11-24 04:44:49,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:44:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26604 states. [2019-11-24 04:44:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26604 to 18338. [2019-11-24 04:44:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18338 states. [2019-11-24 04:44:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18338 states to 18338 states and 33215 transitions. [2019-11-24 04:44:50,521 INFO L78 Accepts]: Start accepts. Automaton has 18338 states and 33215 transitions. Word has length 34 [2019-11-24 04:44:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:44:50,521 INFO L462 AbstractCegarLoop]: Abstraction has 18338 states and 33215 transitions. [2019-11-24 04:44:50,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:44:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 18338 states and 33215 transitions. [2019-11-24 04:44:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:44:50,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:44:50,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:44:50,524 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:44:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:44:50,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1294464740, now seen corresponding path program 1 times [2019-11-24 04:44:50,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:44:50,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191468567] [2019-11-24 04:44:50,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:44:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:44:50,617 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 04:44:50,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191468567] [2019-11-24 04:44:50,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:44:50,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:44:50,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817955716] [2019-11-24 04:44:50,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:44:50,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:44:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:44:50,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:50,620 INFO L87 Difference]: Start difference. First operand 18338 states and 33215 transitions. Second operand 3 states. [2019-11-24 04:44:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:44:51,344 INFO L93 Difference]: Finished difference Result 39175 states and 71114 transitions. [2019-11-24 04:44:51,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:44:51,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:44:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:44:51,371 INFO L225 Difference]: With dead ends: 39175 [2019-11-24 04:44:51,371 INFO L226 Difference]: Without dead ends: 24092 [2019-11-24 04:44:51,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:44:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24092 states.