/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_spec1_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:36:53,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:36:53,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:36:53,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:36:53,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:36:53,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:36:53,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:36:53,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:36:53,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:36:53,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:36:53,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:36:53,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:36:53,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:36:53,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:36:53,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:36:53,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:36:53,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:36:53,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:36:53,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:36:53,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:36:53,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:36:53,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:36:53,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:36:53,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:36:53,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:36:53,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:36:53,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:36:53,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:36:53,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:36:53,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:36:53,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:36:53,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:36:53,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:36:53,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:36:53,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:36:53,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:36:53,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:36:53,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:36:53,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:36:53,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:36:53,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:36:53,405 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:36:53,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:36:53,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:36:53,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:36:53,421 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:36:53,421 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:36:53,421 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:36:53,421 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:36:53,421 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:36:53,421 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:36:53,422 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:36:53,422 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:36:53,422 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:36:53,422 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:36:53,422 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:36:53,423 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:36:53,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:36:53,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:36:53,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:36:53,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:36:53,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:36:53,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:36:53,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:36:53,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:36:53,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:36:53,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:36:53,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:36:53,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:36:53,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:36:53,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:36:53,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:36:53,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:36:53,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:36:53,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:36:53,427 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:36:53,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:36:53,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:36:53,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:36:53,428 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:36:53,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:36:53,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:36:53,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:36:53,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:36:53,733 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:36:53,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product09.cil.c [2019-11-24 04:36:53,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7029fd9cc/d12770d048924a60a48f3fd289400a12/FLAGf8a8c8a0b [2019-11-24 04:36:54,472 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:36:54,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product09.cil.c [2019-11-24 04:36:54,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7029fd9cc/d12770d048924a60a48f3fd289400a12/FLAGf8a8c8a0b [2019-11-24 04:36:54,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7029fd9cc/d12770d048924a60a48f3fd289400a12 [2019-11-24 04:36:54,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:36:54,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:36:54,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:54,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:36:54,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:36:54,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1e4757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:54, skipping insertion in model container [2019-11-24 04:36:54,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:54" (1/1) ... [2019-11-24 04:36:54,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:36:54,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:36:55,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:55,408 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:36:55,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:55,622 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:36:55,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55 WrapperNode [2019-11-24 04:36:55,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:55,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:55,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:36:55,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:36:55,630 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:36:55" (1/1) ... [2019-11-24 04:36:55,664 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:36:55" (1/1) ... [2019-11-24 04:36:55,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:55,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:36:55,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:36:55,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:36:55,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:55,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:55,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:55,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (1/1) ... [2019-11-24 04:36:56,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:36:56,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:36:56,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:36:56,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:36:56,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (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:36:56,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:36:56,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:36:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:36:56,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:37:22,994 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:37:22,994 INFO L284 CfgBuilder]: Removed 493 assume(true) statements. [2019-11-24 04:37:22,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:22 BoogieIcfgContainer [2019-11-24 04:37:22,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:37:22,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:37:22,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:37:23,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:37:23,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:36:54" (1/3) ... [2019-11-24 04:37:23,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6365e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:23, skipping insertion in model container [2019-11-24 04:37:23,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:55" (2/3) ... [2019-11-24 04:37:23,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6365e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:23, skipping insertion in model container [2019-11-24 04:37:23,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:22" (3/3) ... [2019-11-24 04:37:23,004 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product09.cil.c [2019-11-24 04:37:23,013 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:37:23,021 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:37:23,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:37:23,063 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:37:23,063 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:37:23,063 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:37:23,063 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:37:23,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:37:23,064 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:37:23,064 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:37:23,064 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:37:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:37:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:37:23,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:23,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:23,109 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:23,115 INFO L82 PathProgramCache]: Analyzing trace with hash 961248829, now seen corresponding path program 1 times [2019-11-24 04:37:23,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:23,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25768545] [2019-11-24 04:37:23,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:23,591 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:37:23,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25768545] [2019-11-24 04:37:23,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:23,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:23,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727108312] [2019-11-24 04:37:23,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:23,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:23,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:23,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:23,617 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 4 states. [2019-11-24 04:37:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:23,846 INFO L93 Difference]: Finished difference Result 1843 states and 3518 transitions. [2019-11-24 04:37:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:23,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:37:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:23,884 INFO L225 Difference]: With dead ends: 1843 [2019-11-24 04:37:23,885 INFO L226 Difference]: Without dead ends: 1351 [2019-11-24 04:37:23,895 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 04:37:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-24 04:37:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 968. [2019-11-24 04:37:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-24 04:37:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1855 transitions. [2019-11-24 04:37:24,038 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1855 transitions. Word has length 15 [2019-11-24 04:37:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:24,039 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1855 transitions. [2019-11-24 04:37:24,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1855 transitions. [2019-11-24 04:37:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:37:24,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:24,047 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:37:24,048 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:24,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:24,048 INFO L82 PathProgramCache]: Analyzing trace with hash -322168211, now seen corresponding path program 1 times [2019-11-24 04:37:24,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:24,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642236155] [2019-11-24 04:37:24,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:24,408 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:37:24,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642236155] [2019-11-24 04:37:24,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:24,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:24,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88416290] [2019-11-24 04:37:24,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:24,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:24,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:24,415 INFO L87 Difference]: Start difference. First operand 968 states and 1855 transitions. Second operand 4 states. [2019-11-24 04:37:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:24,632 INFO L93 Difference]: Finished difference Result 1722 states and 3240 transitions. [2019-11-24 04:37:24,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:24,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:37:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:24,641 INFO L225 Difference]: With dead ends: 1722 [2019-11-24 04:37:24,641 INFO L226 Difference]: Without dead ends: 1329 [2019-11-24 04:37:24,643 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:37:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-11-24 04:37:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 972. [2019-11-24 04:37:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-24 04:37:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1859 transitions. [2019-11-24 04:37:24,672 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1859 transitions. Word has length 16 [2019-11-24 04:37:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:24,673 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1859 transitions. [2019-11-24 04:37:24,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1859 transitions. [2019-11-24 04:37:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:37:24,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:24,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:24,675 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1077972877, now seen corresponding path program 1 times [2019-11-24 04:37:24,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:24,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315855448] [2019-11-24 04:37:24,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:24,797 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:37:24,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315855448] [2019-11-24 04:37:24,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:24,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:24,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084349763] [2019-11-24 04:37:24,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:24,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:24,800 INFO L87 Difference]: Start difference. First operand 972 states and 1859 transitions. Second operand 5 states. [2019-11-24 04:37:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:24,976 INFO L93 Difference]: Finished difference Result 1724 states and 3258 transitions. [2019-11-24 04:37:24,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:24,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-24 04:37:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:24,984 INFO L225 Difference]: With dead ends: 1724 [2019-11-24 04:37:24,984 INFO L226 Difference]: Without dead ends: 1299 [2019-11-24 04:37:24,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-11-24 04:37:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 977. [2019-11-24 04:37:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-24 04:37:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1864 transitions. [2019-11-24 04:37:25,017 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1864 transitions. Word has length 19 [2019-11-24 04:37:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:25,018 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1864 transitions. [2019-11-24 04:37:25,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1864 transitions. [2019-11-24 04:37:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:37:25,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:25,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:25,020 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:25,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1328311896, now seen corresponding path program 1 times [2019-11-24 04:37:25,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:25,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69949460] [2019-11-24 04:37:25,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:25,118 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:37:25,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69949460] [2019-11-24 04:37:25,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:25,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:25,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69828060] [2019-11-24 04:37:25,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:25,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:25,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:25,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:25,120 INFO L87 Difference]: Start difference. First operand 977 states and 1864 transitions. Second operand 3 states. [2019-11-24 04:37:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:25,185 INFO L93 Difference]: Finished difference Result 1652 states and 3151 transitions. [2019-11-24 04:37:25,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:25,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 04:37:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:25,190 INFO L225 Difference]: With dead ends: 1652 [2019-11-24 04:37:25,191 INFO L226 Difference]: Without dead ends: 971 [2019-11-24 04:37:25,192 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:37:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-11-24 04:37:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2019-11-24 04:37:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-11-24 04:37:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1850 transitions. [2019-11-24 04:37:25,220 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1850 transitions. Word has length 19 [2019-11-24 04:37:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:25,221 INFO L462 AbstractCegarLoop]: Abstraction has 971 states and 1850 transitions. [2019-11-24 04:37:25,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1850 transitions. [2019-11-24 04:37:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:37:25,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:25,222 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:37:25,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1615085157, now seen corresponding path program 1 times [2019-11-24 04:37:25,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:25,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929332802] [2019-11-24 04:37:25,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:25,334 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:37:25,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929332802] [2019-11-24 04:37:25,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:25,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:25,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137439924] [2019-11-24 04:37:25,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:25,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:25,336 INFO L87 Difference]: Start difference. First operand 971 states and 1850 transitions. Second operand 3 states. [2019-11-24 04:37:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:25,424 INFO L93 Difference]: Finished difference Result 2280 states and 4353 transitions. [2019-11-24 04:37:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:25,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 04:37:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:25,434 INFO L225 Difference]: With dead ends: 2280 [2019-11-24 04:37:25,434 INFO L226 Difference]: Without dead ends: 1627 [2019-11-24 04:37:25,436 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:37:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-11-24 04:37:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2019-11-24 04:37:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2019-11-24 04:37:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 3106 transitions. [2019-11-24 04:37:25,484 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 3106 transitions. Word has length 21 [2019-11-24 04:37:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:25,484 INFO L462 AbstractCegarLoop]: Abstraction has 1627 states and 3106 transitions. [2019-11-24 04:37:25,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 3106 transitions. [2019-11-24 04:37:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:37:25,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:25,486 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:37:25,486 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1471950522, now seen corresponding path program 1 times [2019-11-24 04:37:25,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:25,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211956597] [2019-11-24 04:37:25,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:25,651 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:37:25,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211956597] [2019-11-24 04:37:25,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:25,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:25,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615696912] [2019-11-24 04:37:25,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:25,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:25,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:25,654 INFO L87 Difference]: Start difference. First operand 1627 states and 3106 transitions. Second operand 5 states. [2019-11-24 04:37:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:25,846 INFO L93 Difference]: Finished difference Result 2935 states and 5592 transitions. [2019-11-24 04:37:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:25,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-24 04:37:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:25,862 INFO L225 Difference]: With dead ends: 2935 [2019-11-24 04:37:25,862 INFO L226 Difference]: Without dead ends: 2920 [2019-11-24 04:37:25,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2019-11-24 04:37:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1635. [2019-11-24 04:37:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-11-24 04:37:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 3114 transitions. [2019-11-24 04:37:25,947 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 3114 transitions. Word has length 22 [2019-11-24 04:37:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:25,948 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 3114 transitions. [2019-11-24 04:37:25,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 3114 transitions. [2019-11-24 04:37:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:37:25,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:25,953 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] [2019-11-24 04:37:25,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:25,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1849455833, now seen corresponding path program 1 times [2019-11-24 04:37:25,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:25,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83326982] [2019-11-24 04:37:25,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:26,068 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:37:26,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83326982] [2019-11-24 04:37:26,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:26,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:26,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460437245] [2019-11-24 04:37:26,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:26,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:26,071 INFO L87 Difference]: Start difference. First operand 1635 states and 3114 transitions. Second operand 3 states. [2019-11-24 04:37:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:26,128 INFO L93 Difference]: Finished difference Result 1650 states and 3128 transitions. [2019-11-24 04:37:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:26,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:37:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:26,137 INFO L225 Difference]: With dead ends: 1650 [2019-11-24 04:37:26,138 INFO L226 Difference]: Without dead ends: 1635 [2019-11-24 04:37:26,139 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:37:26,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2019-11-24 04:37:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2019-11-24 04:37:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-11-24 04:37:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 3110 transitions. [2019-11-24 04:37:26,194 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 3110 transitions. Word has length 23 [2019-11-24 04:37:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:26,195 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 3110 transitions. [2019-11-24 04:37:26,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 3110 transitions. [2019-11-24 04:37:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:37:26,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:26,196 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] [2019-11-24 04:37:26,197 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1780732496, now seen corresponding path program 1 times [2019-11-24 04:37:26,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:26,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480832471] [2019-11-24 04:37:26,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:26,445 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:37:26,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480832471] [2019-11-24 04:37:26,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:26,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:26,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482275267] [2019-11-24 04:37:26,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:26,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:26,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:26,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:26,447 INFO L87 Difference]: Start difference. First operand 1635 states and 3110 transitions. Second operand 4 states. [2019-11-24 04:37:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:26,986 INFO L93 Difference]: Finished difference Result 3088 states and 5834 transitions. [2019-11-24 04:37:26,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:26,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 04:37:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:26,998 INFO L225 Difference]: With dead ends: 3088 [2019-11-24 04:37:26,998 INFO L226 Difference]: Without dead ends: 2194 [2019-11-24 04:37:27,001 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 04:37:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2019-11-24 04:37:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1641. [2019-11-24 04:37:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-11-24 04:37:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 3072 transitions. [2019-11-24 04:37:27,069 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 3072 transitions. Word has length 24 [2019-11-24 04:37:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:27,070 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 3072 transitions. [2019-11-24 04:37:27,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 3072 transitions. [2019-11-24 04:37:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:37:27,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:27,072 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] [2019-11-24 04:37:27,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash 443469802, now seen corresponding path program 1 times [2019-11-24 04:37:27,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:27,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678471026] [2019-11-24 04:37:27,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:27,259 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:37:27,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678471026] [2019-11-24 04:37:27,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:27,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:27,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971544464] [2019-11-24 04:37:27,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:27,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:27,261 INFO L87 Difference]: Start difference. First operand 1641 states and 3072 transitions. Second operand 5 states. [2019-11-24 04:37:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:27,700 INFO L93 Difference]: Finished difference Result 2806 states and 5208 transitions. [2019-11-24 04:37:27,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:27,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:37:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:27,726 INFO L225 Difference]: With dead ends: 2806 [2019-11-24 04:37:27,726 INFO L226 Difference]: Without dead ends: 2403 [2019-11-24 04:37:27,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-11-24 04:37:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1647. [2019-11-24 04:37:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-11-24 04:37:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3080 transitions. [2019-11-24 04:37:27,859 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3080 transitions. Word has length 26 [2019-11-24 04:37:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:27,860 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 3080 transitions. [2019-11-24 04:37:27,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3080 transitions. [2019-11-24 04:37:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:37:27,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:27,865 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] [2019-11-24 04:37:27,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1603810844, now seen corresponding path program 1 times [2019-11-24 04:37:27,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:27,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038243485] [2019-11-24 04:37:27,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:27,984 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:37:27,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038243485] [2019-11-24 04:37:27,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:27,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:27,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835659145] [2019-11-24 04:37:27,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:27,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:27,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:27,990 INFO L87 Difference]: Start difference. First operand 1647 states and 3080 transitions. Second operand 5 states. [2019-11-24 04:37:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:28,428 INFO L93 Difference]: Finished difference Result 3867 states and 7193 transitions. [2019-11-24 04:37:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:28,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:37:28,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:28,446 INFO L225 Difference]: With dead ends: 3867 [2019-11-24 04:37:28,446 INFO L226 Difference]: Without dead ends: 3061 [2019-11-24 04:37:28,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-11-24 04:37:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 1658. [2019-11-24 04:37:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-11-24 04:37:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 3095 transitions. [2019-11-24 04:37:28,528 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 3095 transitions. Word has length 26 [2019-11-24 04:37:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:28,528 INFO L462 AbstractCegarLoop]: Abstraction has 1658 states and 3095 transitions. [2019-11-24 04:37:28,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 3095 transitions. [2019-11-24 04:37:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:37:28,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:28,530 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] [2019-11-24 04:37:28,530 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:28,531 INFO L82 PathProgramCache]: Analyzing trace with hash -576095440, now seen corresponding path program 1 times [2019-11-24 04:37:28,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:28,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521115128] [2019-11-24 04:37:28,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:28,761 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:37:28,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521115128] [2019-11-24 04:37:28,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:28,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:28,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786674765] [2019-11-24 04:37:28,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:28,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:28,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:28,763 INFO L87 Difference]: Start difference. First operand 1658 states and 3095 transitions. Second operand 6 states. [2019-11-24 04:37:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:29,498 INFO L93 Difference]: Finished difference Result 2914 states and 5404 transitions. [2019-11-24 04:37:29,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:29,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-24 04:37:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:29,510 INFO L225 Difference]: With dead ends: 2914 [2019-11-24 04:37:29,510 INFO L226 Difference]: Without dead ends: 2101 [2019-11-24 04:37:29,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-11-24 04:37:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1993. [2019-11-24 04:37:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-11-24 04:37:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3697 transitions. [2019-11-24 04:37:29,608 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3697 transitions. Word has length 26 [2019-11-24 04:37:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:29,609 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 3697 transitions. [2019-11-24 04:37:29,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3697 transitions. [2019-11-24 04:37:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:37:29,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:29,612 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:37:29,612 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1747048349, now seen corresponding path program 1 times [2019-11-24 04:37:29,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:29,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444363594] [2019-11-24 04:37:29,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:29,779 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:37:29,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444363594] [2019-11-24 04:37:29,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:29,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:29,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392197743] [2019-11-24 04:37:29,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:29,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:29,781 INFO L87 Difference]: Start difference. First operand 1993 states and 3697 transitions. Second operand 4 states. [2019-11-24 04:37:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:30,993 INFO L93 Difference]: Finished difference Result 3543 states and 6584 transitions. [2019-11-24 04:37:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:37:30,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-24 04:37:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:31,004 INFO L225 Difference]: With dead ends: 3543 [2019-11-24 04:37:31,004 INFO L226 Difference]: Without dead ends: 2018 [2019-11-24 04:37:31,008 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:37:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2019-11-24 04:37:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1993. [2019-11-24 04:37:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-11-24 04:37:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3572 transitions. [2019-11-24 04:37:31,135 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3572 transitions. Word has length 35 [2019-11-24 04:37:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:31,135 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 3572 transitions. [2019-11-24 04:37:31,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3572 transitions. [2019-11-24 04:37:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:37:31,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:31,138 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, 1, 1, 1, 1, 1] [2019-11-24 04:37:31,138 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash 982164999, now seen corresponding path program 1 times [2019-11-24 04:37:31,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:31,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286230159] [2019-11-24 04:37:31,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:31,303 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:37:31,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286230159] [2019-11-24 04:37:31,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:31,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:31,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869370573] [2019-11-24 04:37:31,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:31,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:31,305 INFO L87 Difference]: Start difference. First operand 1993 states and 3572 transitions. Second operand 3 states. [2019-11-24 04:37:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:32,396 INFO L93 Difference]: Finished difference Result 3935 states and 7000 transitions. [2019-11-24 04:37:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:32,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 04:37:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:32,404 INFO L225 Difference]: With dead ends: 3935 [2019-11-24 04:37:32,404 INFO L226 Difference]: Without dead ends: 2431 [2019-11-24 04:37:32,407 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:37:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2019-11-24 04:37:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1918. [2019-11-24 04:37:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-11-24 04:37:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 3372 transitions. [2019-11-24 04:37:32,514 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 3372 transitions. Word has length 40 [2019-11-24 04:37:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:32,514 INFO L462 AbstractCegarLoop]: Abstraction has 1918 states and 3372 transitions. [2019-11-24 04:37:32,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 3372 transitions. [2019-11-24 04:37:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:37:32,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:32,517 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, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:32,517 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:32,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1017364709, now seen corresponding path program 1 times [2019-11-24 04:37:32,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:32,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893559799] [2019-11-24 04:37:32,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:32,698 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:37:32,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893559799] [2019-11-24 04:37:32,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:32,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:32,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778706477] [2019-11-24 04:37:32,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:32,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:32,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:32,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:32,700 INFO L87 Difference]: Start difference. First operand 1918 states and 3372 transitions. Second operand 3 states. [2019-11-24 04:37:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:33,629 INFO L93 Difference]: Finished difference Result 3778 states and 6608 transitions. [2019-11-24 04:37:33,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:33,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 04:37:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:33,634 INFO L225 Difference]: With dead ends: 3778 [2019-11-24 04:37:33,634 INFO L226 Difference]: Without dead ends: 2376 [2019-11-24 04:37:33,637 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:37:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-11-24 04:37:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1868. [2019-11-24 04:37:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1868 states. [2019-11-24 04:37:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 3197 transitions. [2019-11-24 04:37:33,744 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 3197 transitions. Word has length 41 [2019-11-24 04:37:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:33,744 INFO L462 AbstractCegarLoop]: Abstraction has 1868 states and 3197 transitions. [2019-11-24 04:37:33,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3197 transitions. [2019-11-24 04:37:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:37:33,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:33,747 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:33,747 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:33,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:33,747 INFO L82 PathProgramCache]: Analyzing trace with hash -812492649, now seen corresponding path program 1 times [2019-11-24 04:37:33,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:33,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264494601] [2019-11-24 04:37:33,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:33,854 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 04:37:33,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264494601] [2019-11-24 04:37:33,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:33,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:37:33,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988132039] [2019-11-24 04:37:33,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:33,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:33,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:33,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:33,856 INFO L87 Difference]: Start difference. First operand 1868 states and 3197 transitions. Second operand 6 states. [2019-11-24 04:37:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:35,073 INFO L93 Difference]: Finished difference Result 5118 states and 8936 transitions. [2019-11-24 04:37:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 04:37:35,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-24 04:37:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:35,082 INFO L225 Difference]: With dead ends: 5118 [2019-11-24 04:37:35,082 INFO L226 Difference]: Without dead ends: 4022 [2019-11-24 04:37:35,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:37:35,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2019-11-24 04:37:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3334. [2019-11-24 04:37:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2019-11-24 04:37:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 5507 transitions. [2019-11-24 04:37:35,303 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 5507 transitions. Word has length 43 [2019-11-24 04:37:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:35,304 INFO L462 AbstractCegarLoop]: Abstraction has 3334 states and 5507 transitions. [2019-11-24 04:37:35,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 5507 transitions. [2019-11-24 04:37:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:37:35,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:35,308 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:35,309 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash -522515394, now seen corresponding path program 1 times [2019-11-24 04:37:35,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:35,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795239676] [2019-11-24 04:37:35,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:35,442 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 04:37:35,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795239676] [2019-11-24 04:37:35,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:35,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:37:35,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257854420] [2019-11-24 04:37:35,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:35,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:35,445 INFO L87 Difference]: Start difference. First operand 3334 states and 5507 transitions. Second operand 6 states. [2019-11-24 04:37:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:35,952 INFO L93 Difference]: Finished difference Result 7669 states and 12626 transitions. [2019-11-24 04:37:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 04:37:35,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-24 04:37:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:35,964 INFO L225 Difference]: With dead ends: 7669 [2019-11-24 04:37:35,964 INFO L226 Difference]: Without dead ends: 5107 [2019-11-24 04:37:35,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-24 04:37:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2019-11-24 04:37:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 3370. [2019-11-24 04:37:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2019-11-24 04:37:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 5555 transitions. [2019-11-24 04:37:36,205 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 5555 transitions. Word has length 43 [2019-11-24 04:37:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:36,205 INFO L462 AbstractCegarLoop]: Abstraction has 3370 states and 5555 transitions. [2019-11-24 04:37:36,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 5555 transitions. [2019-11-24 04:37:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:37:36,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:36,211 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:36,211 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash -178308648, now seen corresponding path program 1 times [2019-11-24 04:37:36,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:36,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468174981] [2019-11-24 04:37:36,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:36,325 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 04:37:36,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468174981] [2019-11-24 04:37:36,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:36,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:37:36,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10936508] [2019-11-24 04:37:36,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:36,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:36,327 INFO L87 Difference]: Start difference. First operand 3370 states and 5555 transitions. Second operand 6 states. [2019-11-24 04:37:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:37,070 INFO L93 Difference]: Finished difference Result 4950 states and 8237 transitions. [2019-11-24 04:37:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:37:37,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-24 04:37:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:37,076 INFO L225 Difference]: With dead ends: 4950 [2019-11-24 04:37:37,076 INFO L226 Difference]: Without dead ends: 2344 [2019-11-24 04:37:37,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:37:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2019-11-24 04:37:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2321. [2019-11-24 04:37:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-11-24 04:37:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3872 transitions. [2019-11-24 04:37:37,193 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3872 transitions. Word has length 43 [2019-11-24 04:37:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:37,193 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 3872 transitions. [2019-11-24 04:37:37,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3872 transitions. [2019-11-24 04:37:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:37:37,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:37,195 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:37,196 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:37,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1625893088, now seen corresponding path program 1 times [2019-11-24 04:37:37,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:37,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708288757] [2019-11-24 04:37:37,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:37,381 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:37:37,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708288757] [2019-11-24 04:37:37,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:37,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:37,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205495069] [2019-11-24 04:37:37,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:37,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:37,384 INFO L87 Difference]: Start difference. First operand 2321 states and 3872 transitions. Second operand 3 states. [2019-11-24 04:37:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:38,314 INFO L93 Difference]: Finished difference Result 4585 states and 7624 transitions. [2019-11-24 04:37:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:38,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 04:37:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:38,321 INFO L225 Difference]: With dead ends: 4585 [2019-11-24 04:37:38,321 INFO L226 Difference]: Without dead ends: 2833 [2019-11-24 04:37:38,324 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:37:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2019-11-24 04:37:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2286. [2019-11-24 04:37:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-11-24 04:37:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3662 transitions. [2019-11-24 04:37:38,467 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3662 transitions. Word has length 43 [2019-11-24 04:37:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:38,467 INFO L462 AbstractCegarLoop]: Abstraction has 2286 states and 3662 transitions. [2019-11-24 04:37:38,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3662 transitions. [2019-11-24 04:37:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 04:37:38,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:38,470 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:38,470 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1327877315, now seen corresponding path program 1 times [2019-11-24 04:37:38,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:38,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862700389] [2019-11-24 04:37:38,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:38,632 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 04:37:38,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862700389] [2019-11-24 04:37:38,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118968018] [2019-11-24 04:37:38,633 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 04:37:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:38,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:37:38,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:37:39,050 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 04:37:39,050 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:37:39,095 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 04:37:39,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1682056431] [2019-11-24 04:37:39,123 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2019-11-24 04:37:39,124 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:37:39,130 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:37:39,137 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:37:39,138 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:38:15,310 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 770