/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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:49:39,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:49:39,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:49:39,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:49:39,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:49:39,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:49:39,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:49:39,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:49:39,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:49:39,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:49:39,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:49:39,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:49:39,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:49:39,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:49:39,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:49:39,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:49:39,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:49:39,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:49:39,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:49:39,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:49:39,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:49:39,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:49:39,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:49:39,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:49:39,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:49:39,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:49:39,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:49:39,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:49:39,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:49:39,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:49:39,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:49:39,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:49:39,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:49:39,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:49:39,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:49:39,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:49:39,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:49:39,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:49:39,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:49:39,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:49:39,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:49:39,398 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 05:49:39,420 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:49:39,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:49:39,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:49:39,421 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:49:39,422 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:49:39,422 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:49:39,422 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:49:39,422 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:49:39,422 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:49:39,422 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:49:39,423 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:49:39,424 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:49:39,424 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:49:39,424 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:49:39,425 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:49:39,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:49:39,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:49:39,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:49:39,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:49:39,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:49:39,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:49:39,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:49:39,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:49:39,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:49:39,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:49:39,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:49:39,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:49:39,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:49:39,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:49:39,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:49:39,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:49:39,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:49:39,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:49:39,430 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:49:39,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:49:39,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:49:39,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:49:39,431 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:49:39,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:49:39,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:49:39,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:49:39,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:49:39,766 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:49:39,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-11-24 05:49:39,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e54b5b0a/447962aa5b38462ba04cf13c83d900b2/FLAG67f434c0f [2019-11-24 05:49:40,321 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:49:40,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-11-24 05:49:40,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e54b5b0a/447962aa5b38462ba04cf13c83d900b2/FLAG67f434c0f [2019-11-24 05:49:40,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e54b5b0a/447962aa5b38462ba04cf13c83d900b2 [2019-11-24 05:49:40,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:49:40,694 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:49:40,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:40,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:49:40,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:49:40,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:40" (1/1) ... [2019-11-24 05:49:40,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfca6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:40, skipping insertion in model container [2019-11-24 05:49:40,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:40" (1/1) ... [2019-11-24 05:49:40,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:49:40,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:49:41,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:41,230 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:49:41,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:41,354 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:49:41,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41 WrapperNode [2019-11-24 05:49:41,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:41,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:41,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:49:41,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:49:41,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:41,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:49:41,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:49:41,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:49:41,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (1/1) ... [2019-11-24 05:49:41,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:49:41,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:49:41,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:49:41,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:49:41,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (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 05:49:41,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:49:41,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:49:43,362 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:49:43,363 INFO L284 CfgBuilder]: Removed 119 assume(true) statements. [2019-11-24 05:49:43,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:43 BoogieIcfgContainer [2019-11-24 05:49:43,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:49:43,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:49:43,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:49:43,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:49:43,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:49:40" (1/3) ... [2019-11-24 05:49:43,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892c123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:43, skipping insertion in model container [2019-11-24 05:49:43,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:41" (2/3) ... [2019-11-24 05:49:43,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5892c123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:43, skipping insertion in model container [2019-11-24 05:49:43,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:43" (3/3) ... [2019-11-24 05:49:43,380 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-11-24 05:49:43,392 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:49:43,402 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-24 05:49:43,416 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-24 05:49:43,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:49:43,457 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:49:43,457 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:49:43,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:49:43,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:49:43,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:49:43,458 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:49:43,458 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:49:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states. [2019-11-24 05:49:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 05:49:43,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:43,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:43,506 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash -339087412, now seen corresponding path program 1 times [2019-11-24 05:49:43,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:43,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177073769] [2019-11-24 05:49:43,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:43,881 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 05:49:43,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177073769] [2019-11-24 05:49:43,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:43,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:43,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848904638] [2019-11-24 05:49:43,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:43,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:43,911 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 3 states. [2019-11-24 05:49:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:44,082 INFO L93 Difference]: Finished difference Result 477 states and 740 transitions. [2019-11-24 05:49:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:44,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 05:49:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:44,107 INFO L225 Difference]: With dead ends: 477 [2019-11-24 05:49:44,108 INFO L226 Difference]: Without dead ends: 238 [2019-11-24 05:49:44,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 05:49:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-24 05:49:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 213. [2019-11-24 05:49:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-24 05:49:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2019-11-24 05:49:44,188 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 11 [2019-11-24 05:49:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:44,188 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2019-11-24 05:49:44,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2019-11-24 05:49:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:49:44,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:44,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:44,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:44,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:44,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2004755406, now seen corresponding path program 1 times [2019-11-24 05:49:44,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:44,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985493976] [2019-11-24 05:49:44,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:44,366 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 05:49:44,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985493976] [2019-11-24 05:49:44,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:44,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:44,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849235637] [2019-11-24 05:49:44,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:44,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:44,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:44,370 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 5 states. [2019-11-24 05:49:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:44,443 INFO L93 Difference]: Finished difference Result 652 states and 949 transitions. [2019-11-24 05:49:44,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:44,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 05:49:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:44,447 INFO L225 Difference]: With dead ends: 652 [2019-11-24 05:49:44,448 INFO L226 Difference]: Without dead ends: 440 [2019-11-24 05:49:44,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-24 05:49:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 235. [2019-11-24 05:49:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-24 05:49:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2019-11-24 05:49:44,490 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 15 [2019-11-24 05:49:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:44,490 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2019-11-24 05:49:44,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2019-11-24 05:49:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 05:49:44,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:44,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:44,493 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash 813991417, now seen corresponding path program 1 times [2019-11-24 05:49:44,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:44,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546187722] [2019-11-24 05:49:44,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:44,614 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 05:49:44,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546187722] [2019-11-24 05:49:44,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:44,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:44,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611015860] [2019-11-24 05:49:44,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:44,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:44,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:44,621 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 5 states. [2019-11-24 05:49:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:44,735 INFO L93 Difference]: Finished difference Result 861 states and 1252 transitions. [2019-11-24 05:49:44,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:49:44,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 05:49:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:44,751 INFO L225 Difference]: With dead ends: 861 [2019-11-24 05:49:44,753 INFO L226 Difference]: Without dead ends: 649 [2019-11-24 05:49:44,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:49:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-24 05:49:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 236. [2019-11-24 05:49:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-24 05:49:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 344 transitions. [2019-11-24 05:49:44,791 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 344 transitions. Word has length 16 [2019-11-24 05:49:44,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:44,792 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 344 transitions. [2019-11-24 05:49:44,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 344 transitions. [2019-11-24 05:49:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:49:44,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:44,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:44,793 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1768366250, now seen corresponding path program 1 times [2019-11-24 05:49:44,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:44,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051420370] [2019-11-24 05:49:44,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:44,874 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 05:49:44,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051420370] [2019-11-24 05:49:44,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:44,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:44,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372894772] [2019-11-24 05:49:44,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:44,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:44,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:44,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:44,877 INFO L87 Difference]: Start difference. First operand 236 states and 344 transitions. Second operand 4 states. [2019-11-24 05:49:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:44,935 INFO L93 Difference]: Finished difference Result 680 states and 984 transitions. [2019-11-24 05:49:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:49:44,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 05:49:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:44,940 INFO L225 Difference]: With dead ends: 680 [2019-11-24 05:49:44,940 INFO L226 Difference]: Without dead ends: 454 [2019-11-24 05:49:44,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-24 05:49:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 240. [2019-11-24 05:49:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-24 05:49:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2019-11-24 05:49:44,963 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 18 [2019-11-24 05:49:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:44,963 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2019-11-24 05:49:44,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2019-11-24 05:49:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 05:49:44,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:44,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:44,966 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash -513449963, now seen corresponding path program 1 times [2019-11-24 05:49:44,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:44,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706019774] [2019-11-24 05:49:44,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,069 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 05:49:45,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706019774] [2019-11-24 05:49:45,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:45,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:45,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766269004] [2019-11-24 05:49:45,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:45,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:45,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:45,072 INFO L87 Difference]: Start difference. First operand 240 states and 348 transitions. Second operand 3 states. [2019-11-24 05:49:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:45,100 INFO L93 Difference]: Finished difference Result 484 states and 703 transitions. [2019-11-24 05:49:45,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:45,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 05:49:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:45,102 INFO L225 Difference]: With dead ends: 484 [2019-11-24 05:49:45,103 INFO L226 Difference]: Without dead ends: 270 [2019-11-24 05:49:45,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 05:49:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-24 05:49:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2019-11-24 05:49:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-24 05:49:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 340 transitions. [2019-11-24 05:49:45,115 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 340 transitions. Word has length 20 [2019-11-24 05:49:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:45,115 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 340 transitions. [2019-11-24 05:49:45,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 340 transitions. [2019-11-24 05:49:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:49:45,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:45,121 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 05:49:45,122 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:45,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1309875859, now seen corresponding path program 1 times [2019-11-24 05:49:45,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:45,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079376872] [2019-11-24 05:49:45,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,264 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 05:49:45,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079376872] [2019-11-24 05:49:45,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:45,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:45,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464298240] [2019-11-24 05:49:45,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:45,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:45,267 INFO L87 Difference]: Start difference. First operand 235 states and 340 transitions. Second operand 5 states. [2019-11-24 05:49:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:45,418 INFO L93 Difference]: Finished difference Result 581 states and 850 transitions. [2019-11-24 05:49:45,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:49:45,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 05:49:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:45,421 INFO L225 Difference]: With dead ends: 581 [2019-11-24 05:49:45,421 INFO L226 Difference]: Without dead ends: 372 [2019-11-24 05:49:45,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-24 05:49:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 205. [2019-11-24 05:49:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-24 05:49:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 294 transitions. [2019-11-24 05:49:45,456 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 294 transitions. Word has length 24 [2019-11-24 05:49:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:45,457 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 294 transitions. [2019-11-24 05:49:45,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 294 transitions. [2019-11-24 05:49:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:49:45,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:45,458 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] [2019-11-24 05:49:45,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1047107925, now seen corresponding path program 1 times [2019-11-24 05:49:45,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:45,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635882937] [2019-11-24 05:49:45,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,566 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 05:49:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635882937] [2019-11-24 05:49:45,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:45,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:45,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825613090] [2019-11-24 05:49:45,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:45,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:45,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:45,568 INFO L87 Difference]: Start difference. First operand 205 states and 294 transitions. Second operand 5 states. [2019-11-24 05:49:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:45,729 INFO L93 Difference]: Finished difference Result 646 states and 931 transitions. [2019-11-24 05:49:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:49:45,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-24 05:49:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:45,732 INFO L225 Difference]: With dead ends: 646 [2019-11-24 05:49:45,732 INFO L226 Difference]: Without dead ends: 467 [2019-11-24 05:49:45,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-11-24 05:49:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 175. [2019-11-24 05:49:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-24 05:49:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2019-11-24 05:49:45,749 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 29 [2019-11-24 05:49:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:45,749 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2019-11-24 05:49:45,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2019-11-24 05:49:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:45,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:45,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:45,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1774384857, now seen corresponding path program 1 times [2019-11-24 05:49:45,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:45,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521037910] [2019-11-24 05:49:45,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,900 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 05:49:45,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521037910] [2019-11-24 05:49:45,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:45,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:45,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390127365] [2019-11-24 05:49:45,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:45,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:45,903 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand 6 states. [2019-11-24 05:49:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,137 INFO L93 Difference]: Finished difference Result 665 states and 936 transitions. [2019-11-24 05:49:46,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:46,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-24 05:49:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,141 INFO L225 Difference]: With dead ends: 665 [2019-11-24 05:49:46,142 INFO L226 Difference]: Without dead ends: 516 [2019-11-24 05:49:46,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:49:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-24 05:49:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 210. [2019-11-24 05:49:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-24 05:49:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2019-11-24 05:49:46,163 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 34 [2019-11-24 05:49:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,164 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2019-11-24 05:49:46,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2019-11-24 05:49:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 05:49:46,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,165 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 05:49:46,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash 729186236, now seen corresponding path program 1 times [2019-11-24 05:49:46,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296171570] [2019-11-24 05:49:46,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,219 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 05:49:46,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296171570] [2019-11-24 05:49:46,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:46,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974641542] [2019-11-24 05:49:46,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:46,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,221 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand 3 states. [2019-11-24 05:49:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,310 INFO L93 Difference]: Finished difference Result 382 states and 543 transitions. [2019-11-24 05:49:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:46,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 05:49:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,312 INFO L225 Difference]: With dead ends: 382 [2019-11-24 05:49:46,312 INFO L226 Difference]: Without dead ends: 233 [2019-11-24 05:49:46,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 05:49:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-24 05:49:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2019-11-24 05:49:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-24 05:49:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2019-11-24 05:49:46,330 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 35 [2019-11-24 05:49:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,331 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2019-11-24 05:49:46,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2019-11-24 05:49:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 05:49:46,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,332 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] [2019-11-24 05:49:46,332 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1574352713, now seen corresponding path program 1 times [2019-11-24 05:49:46,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331157208] [2019-11-24 05:49:46,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,469 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 05:49:46,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331157208] [2019-11-24 05:49:46,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:46,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197600841] [2019-11-24 05:49:46,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:46,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:46,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:46,472 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand 7 states. [2019-11-24 05:49:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,845 INFO L93 Difference]: Finished difference Result 942 states and 1316 transitions. [2019-11-24 05:49:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:46,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-24 05:49:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,852 INFO L225 Difference]: With dead ends: 942 [2019-11-24 05:49:46,852 INFO L226 Difference]: Without dead ends: 778 [2019-11-24 05:49:46,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:49:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-24 05:49:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 260. [2019-11-24 05:49:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-24 05:49:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 367 transitions. [2019-11-24 05:49:46,885 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 367 transitions. Word has length 38 [2019-11-24 05:49:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,887 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 367 transitions. [2019-11-24 05:49:46,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 367 transitions. [2019-11-24 05:49:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 05:49:46,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,889 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] [2019-11-24 05:49:46,889 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1590994410, now seen corresponding path program 1 times [2019-11-24 05:49:46,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636128643] [2019-11-24 05:49:46,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,961 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 05:49:46,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636128643] [2019-11-24 05:49:46,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:46,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484923191] [2019-11-24 05:49:46,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:46,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:46,963 INFO L87 Difference]: Start difference. First operand 260 states and 367 transitions. Second operand 4 states. [2019-11-24 05:49:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:47,078 INFO L93 Difference]: Finished difference Result 733 states and 1023 transitions. [2019-11-24 05:49:47,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:47,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-24 05:49:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:47,082 INFO L225 Difference]: With dead ends: 733 [2019-11-24 05:49:47,082 INFO L226 Difference]: Without dead ends: 551 [2019-11-24 05:49:47,083 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 05:49:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-11-24 05:49:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 383. [2019-11-24 05:49:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-24 05:49:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 533 transitions. [2019-11-24 05:49:47,121 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 533 transitions. Word has length 38 [2019-11-24 05:49:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:47,121 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 533 transitions. [2019-11-24 05:49:47,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 533 transitions. [2019-11-24 05:49:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 05:49:47,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:47,122 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] [2019-11-24 05:49:47,123 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1289863396, now seen corresponding path program 1 times [2019-11-24 05:49:47,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:47,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523001307] [2019-11-24 05:49:47,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,182 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 05:49:47,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523001307] [2019-11-24 05:49:47,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:47,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:47,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462022171] [2019-11-24 05:49:47,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:47,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:47,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:47,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:47,186 INFO L87 Difference]: Start difference. First operand 383 states and 533 transitions. Second operand 3 states. [2019-11-24 05:49:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:47,300 INFO L93 Difference]: Finished difference Result 767 states and 1072 transitions. [2019-11-24 05:49:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:47,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 05:49:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:47,305 INFO L225 Difference]: With dead ends: 767 [2019-11-24 05:49:47,305 INFO L226 Difference]: Without dead ends: 478 [2019-11-24 05:49:47,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 05:49:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-24 05:49:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 377. [2019-11-24 05:49:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-24 05:49:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 519 transitions. [2019-11-24 05:49:47,340 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 519 transitions. Word has length 39 [2019-11-24 05:49:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:47,341 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 519 transitions. [2019-11-24 05:49:47,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 519 transitions. [2019-11-24 05:49:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 05:49:47,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:47,343 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] [2019-11-24 05:49:47,344 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1102134898, now seen corresponding path program 1 times [2019-11-24 05:49:47,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:47,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215405502] [2019-11-24 05:49:47,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,514 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 05:49:47,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215405502] [2019-11-24 05:49:47,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:47,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:47,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278844689] [2019-11-24 05:49:47,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:47,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:47,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:47,517 INFO L87 Difference]: Start difference. First operand 377 states and 519 transitions. Second operand 6 states. [2019-11-24 05:49:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:47,825 INFO L93 Difference]: Finished difference Result 1181 states and 1628 transitions. [2019-11-24 05:49:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:47,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-24 05:49:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:47,832 INFO L225 Difference]: With dead ends: 1181 [2019-11-24 05:49:47,832 INFO L226 Difference]: Without dead ends: 937 [2019-11-24 05:49:47,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:49:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-11-24 05:49:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 381. [2019-11-24 05:49:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-24 05:49:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 524 transitions. [2019-11-24 05:49:47,878 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 524 transitions. Word has length 39 [2019-11-24 05:49:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:47,879 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 524 transitions. [2019-11-24 05:49:47,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 524 transitions. [2019-11-24 05:49:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 05:49:47,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:47,880 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] [2019-11-24 05:49:47,880 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1012170325, now seen corresponding path program 1 times [2019-11-24 05:49:47,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:47,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611834120] [2019-11-24 05:49:47,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,992 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 05:49:47,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611834120] [2019-11-24 05:49:47,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:47,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:47,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939832618] [2019-11-24 05:49:47,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:47,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:47,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:47,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:47,995 INFO L87 Difference]: Start difference. First operand 381 states and 524 transitions. Second operand 5 states. [2019-11-24 05:49:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:48,226 INFO L93 Difference]: Finished difference Result 751 states and 1058 transitions. [2019-11-24 05:49:48,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:48,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-24 05:49:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:48,230 INFO L225 Difference]: With dead ends: 751 [2019-11-24 05:49:48,230 INFO L226 Difference]: Without dead ends: 749 [2019-11-24 05:49:48,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:49:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-11-24 05:49:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 383. [2019-11-24 05:49:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-24 05:49:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2019-11-24 05:49:48,267 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 39 [2019-11-24 05:49:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:48,268 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2019-11-24 05:49:48,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2019-11-24 05:49:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 05:49:48,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:48,269 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 05:49:48,269 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash -720424917, now seen corresponding path program 1 times [2019-11-24 05:49:48,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:48,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488140858] [2019-11-24 05:49:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:48,369 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 05:49:48,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488140858] [2019-11-24 05:49:48,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:48,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:48,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765064852] [2019-11-24 05:49:48,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:48,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:48,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:48,371 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand 6 states. [2019-11-24 05:49:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:48,530 INFO L93 Difference]: Finished difference Result 841 states and 1183 transitions. [2019-11-24 05:49:48,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:48,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-24 05:49:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:48,534 INFO L225 Difference]: With dead ends: 841 [2019-11-24 05:49:48,534 INFO L226 Difference]: Without dead ends: 595 [2019-11-24 05:49:48,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:49:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-11-24 05:49:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 389. [2019-11-24 05:49:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-24 05:49:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 532 transitions. [2019-11-24 05:49:48,572 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 532 transitions. Word has length 40 [2019-11-24 05:49:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:48,572 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 532 transitions. [2019-11-24 05:49:48,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 532 transitions. [2019-11-24 05:49:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 05:49:48,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:48,573 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 05:49:48,574 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1889246475, now seen corresponding path program 1 times [2019-11-24 05:49:48,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:48,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705872174] [2019-11-24 05:49:48,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:48,673 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 05:49:48,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705872174] [2019-11-24 05:49:48,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:48,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:48,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063668017] [2019-11-24 05:49:48,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:48,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:48,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:48,675 INFO L87 Difference]: Start difference. First operand 389 states and 532 transitions. Second operand 7 states. [2019-11-24 05:49:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:49,133 INFO L93 Difference]: Finished difference Result 1765 states and 2386 transitions. [2019-11-24 05:49:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:49,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-24 05:49:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:49,141 INFO L225 Difference]: With dead ends: 1765 [2019-11-24 05:49:49,142 INFO L226 Difference]: Without dead ends: 1490 [2019-11-24 05:49:49,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:49:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-11-24 05:49:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 495. [2019-11-24 05:49:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-24 05:49:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 670 transitions. [2019-11-24 05:49:49,225 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 670 transitions. Word has length 40 [2019-11-24 05:49:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:49,226 INFO L462 AbstractCegarLoop]: Abstraction has 495 states and 670 transitions. [2019-11-24 05:49:49,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 670 transitions. [2019-11-24 05:49:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 05:49:49,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:49,227 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 05:49:49,227 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1849957058, now seen corresponding path program 1 times [2019-11-24 05:49:49,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:49,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895565986] [2019-11-24 05:49:49,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:49,283 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 05:49:49,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895565986] [2019-11-24 05:49:49,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:49,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:49,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552591481] [2019-11-24 05:49:49,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:49,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:49,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:49,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:49,285 INFO L87 Difference]: Start difference. First operand 495 states and 670 transitions. Second operand 3 states. [2019-11-24 05:49:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:49,389 INFO L93 Difference]: Finished difference Result 1032 states and 1398 transitions. [2019-11-24 05:49:49,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:49,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 05:49:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:49,393 INFO L225 Difference]: With dead ends: 1032 [2019-11-24 05:49:49,393 INFO L226 Difference]: Without dead ends: 697 [2019-11-24 05:49:49,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 05:49:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-11-24 05:49:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 464. [2019-11-24 05:49:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-24 05:49:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 623 transitions. [2019-11-24 05:49:49,442 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 623 transitions. Word has length 41 [2019-11-24 05:49:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:49,443 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 623 transitions. [2019-11-24 05:49:49,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 623 transitions. [2019-11-24 05:49:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:49:49,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:49,444 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] [2019-11-24 05:49:49,444 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -569210678, now seen corresponding path program 1 times [2019-11-24 05:49:49,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:49,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097991296] [2019-11-24 05:49:49,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:49,525 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 05:49:49,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097991296] [2019-11-24 05:49:49,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:49,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:49,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275884961] [2019-11-24 05:49:49,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:49,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:49,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:49,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:49,527 INFO L87 Difference]: Start difference. First operand 464 states and 623 transitions. Second operand 4 states. [2019-11-24 05:49:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:49,668 INFO L93 Difference]: Finished difference Result 1259 states and 1673 transitions. [2019-11-24 05:49:49,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:49,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-24 05:49:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:49,673 INFO L225 Difference]: With dead ends: 1259 [2019-11-24 05:49:49,673 INFO L226 Difference]: Without dead ends: 941 [2019-11-24 05:49:49,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:49:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-11-24 05:49:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 645. [2019-11-24 05:49:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-11-24 05:49:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 858 transitions. [2019-11-24 05:49:49,746 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 858 transitions. Word has length 42 [2019-11-24 05:49:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:49,747 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 858 transitions. [2019-11-24 05:49:49,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 858 transitions. [2019-11-24 05:49:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:49:49,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:49,748 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] [2019-11-24 05:49:49,748 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:49,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1816717446, now seen corresponding path program 1 times [2019-11-24 05:49:49,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:49,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330386876] [2019-11-24 05:49:49,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:49,785 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 05:49:49,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330386876] [2019-11-24 05:49:49,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:49,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:49,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431789817] [2019-11-24 05:49:49,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:49,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:49,787 INFO L87 Difference]: Start difference. First operand 645 states and 858 transitions. Second operand 4 states. [2019-11-24 05:49:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:49,929 INFO L93 Difference]: Finished difference Result 1432 states and 1891 transitions. [2019-11-24 05:49:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:49,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-24 05:49:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:49,933 INFO L225 Difference]: With dead ends: 1432 [2019-11-24 05:49:49,934 INFO L226 Difference]: Without dead ends: 820 [2019-11-24 05:49:49,935 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 05:49:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-11-24 05:49:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 566. [2019-11-24 05:49:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-11-24 05:49:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 745 transitions. [2019-11-24 05:49:49,996 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 745 transitions. Word has length 42 [2019-11-24 05:49:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:49,996 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 745 transitions. [2019-11-24 05:49:49,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 745 transitions. [2019-11-24 05:49:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 05:49:49,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:49,997 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, 1, 1] [2019-11-24 05:49:49,997 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1264684076, now seen corresponding path program 1 times [2019-11-24 05:49:49,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:49,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474716748] [2019-11-24 05:49:49,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:50,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474716748] [2019-11-24 05:49:50,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:50,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:50,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886899449] [2019-11-24 05:49:50,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:50,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:50,032 INFO L87 Difference]: Start difference. First operand 566 states and 745 transitions. Second operand 4 states. [2019-11-24 05:49:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:50,131 INFO L93 Difference]: Finished difference Result 1304 states and 1714 transitions. [2019-11-24 05:49:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:50,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-24 05:49:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:50,135 INFO L225 Difference]: With dead ends: 1304 [2019-11-24 05:49:50,135 INFO L226 Difference]: Without dead ends: 776 [2019-11-24 05:49:50,136 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 05:49:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-11-24 05:49:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 524. [2019-11-24 05:49:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-24 05:49:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 685 transitions. [2019-11-24 05:49:50,197 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 685 transitions. Word has length 45 [2019-11-24 05:49:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:50,197 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 685 transitions. [2019-11-24 05:49:50,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 685 transitions. [2019-11-24 05:49:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-24 05:49:50,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:50,199 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:50,199 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:50,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:50,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1274141526, now seen corresponding path program 1 times [2019-11-24 05:49:50,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:50,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608426711] [2019-11-24 05:49:50,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:50,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608426711] [2019-11-24 05:49:50,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428465734] [2019-11-24 05:49:50,307 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 05:49:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:50,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:50,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:50,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:50,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:50,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:50,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:50,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:50,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:50,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 9 [2019-11-24 05:49:50,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450917876] [2019-11-24 05:49:50,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:50,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:49:50,608 INFO L87 Difference]: Start difference. First operand 524 states and 685 transitions. Second operand 6 states. [2019-11-24 05:49:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:51,045 INFO L93 Difference]: Finished difference Result 1541 states and 2079 transitions. [2019-11-24 05:49:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:51,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-24 05:49:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:51,051 INFO L225 Difference]: With dead ends: 1541 [2019-11-24 05:49:51,051 INFO L226 Difference]: Without dead ends: 1108 [2019-11-24 05:49:51,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:49:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2019-11-24 05:49:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 524. [2019-11-24 05:49:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-24 05:49:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 682 transitions. [2019-11-24 05:49:51,147 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 682 transitions. Word has length 69 [2019-11-24 05:49:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:51,148 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 682 transitions. [2019-11-24 05:49:51,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 682 transitions. [2019-11-24 05:49:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 05:49:51,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:51,155 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:51,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:51,359 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:51,360 INFO L82 PathProgramCache]: Analyzing trace with hash 110989519, now seen corresponding path program 1 times [2019-11-24 05:49:51,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:51,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173104798] [2019-11-24 05:49:51,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:51,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173104798] [2019-11-24 05:49:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468682238] [2019-11-24 05:49:51,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:51,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:51,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:51,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:51,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:51,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:51,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-11-24 05:49:51,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724893349] [2019-11-24 05:49:51,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:51,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:49:51,790 INFO L87 Difference]: Start difference. First operand 524 states and 682 transitions. Second operand 6 states. [2019-11-24 05:49:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:52,105 INFO L93 Difference]: Finished difference Result 1376 states and 1838 transitions. [2019-11-24 05:49:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:52,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-11-24 05:49:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:52,110 INFO L225 Difference]: With dead ends: 1376 [2019-11-24 05:49:52,110 INFO L226 Difference]: Without dead ends: 943 [2019-11-24 05:49:52,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:49:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-24 05:49:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 524. [2019-11-24 05:49:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-24 05:49:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 679 transitions. [2019-11-24 05:49:52,210 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 679 transitions. Word has length 73 [2019-11-24 05:49:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:52,210 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 679 transitions. [2019-11-24 05:49:52,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 679 transitions. [2019-11-24 05:49:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 05:49:52,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:52,212 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:52,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:52,419 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1217385223, now seen corresponding path program 1 times [2019-11-24 05:49:52,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:52,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143688110] [2019-11-24 05:49:52,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:52,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143688110] [2019-11-24 05:49:52,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969277017] [2019-11-24 05:49:52,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:52,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:52,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:52,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:49:52,787 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:49:52,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:52,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 9 [2019-11-24 05:49:52,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899257366] [2019-11-24 05:49:52,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:52,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:49:52,805 INFO L87 Difference]: Start difference. First operand 524 states and 679 transitions. Second operand 6 states. [2019-11-24 05:49:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:53,077 INFO L93 Difference]: Finished difference Result 1267 states and 1698 transitions. [2019-11-24 05:49:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:53,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-11-24 05:49:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:53,081 INFO L225 Difference]: With dead ends: 1267 [2019-11-24 05:49:53,082 INFO L226 Difference]: Without dead ends: 848 [2019-11-24 05:49:53,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:49:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-11-24 05:49:53,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 524. [2019-11-24 05:49:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-24 05:49:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 678 transitions. [2019-11-24 05:49:53,150 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 678 transitions. Word has length 76 [2019-11-24 05:49:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:53,150 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 678 transitions. [2019-11-24 05:49:53,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 678 transitions. [2019-11-24 05:49:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-24 05:49:53,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:53,152 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:53,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:53,357 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1178209132, now seen corresponding path program 1 times [2019-11-24 05:49:53,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:53,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631457145] [2019-11-24 05:49:53,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:53,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631457145] [2019-11-24 05:49:53,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462850163] [2019-11-24 05:49:53,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:53,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-24 05:49:53,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:53,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:53,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:53,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:53,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:53,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:54,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:54,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:54,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1794076643] [2019-11-24 05:49:54,200 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2019-11-24 05:49:54,201 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:49:54,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:49:54,214 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:49:54,214 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:49:56,187 WARN L192 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 516 DAG size of output: 457 [2019-11-24 05:49:56,292 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:56,296 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:57,900 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 458 DAG size of output: 458 [2019-11-24 05:49:59,406 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:49:59,419 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:49:59,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:59,454 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:59,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:59,463 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:59,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:59,472 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:59,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:59,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:00,998 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:01,002 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:01,273 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:01,276 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:02,604 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10392 conjuctions. This might take some time... [2019-11-24 05:50:10,912 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:10,916 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:11,182 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:11,186 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:12,565 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:12,569 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:12,576 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:12,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:13,659 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:13,662 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:13,712 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:13,715 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:14,833 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:14,836 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:14,857 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:14,859 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:15,973 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:15,976 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:16,228 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:16,230 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:17,738 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:17,742 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:17,747 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:17,751 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:18,872 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 13944 conjuctions. This might take some time... [2019-11-24 05:50:40,463 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10516 conjuctions. This might take some time... [2019-11-24 05:50:48,442 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:48,445 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:48,448 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:48,451 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:48,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:50:48,466 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:50:48,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:48,479 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:50,579 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:50,582 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:50,604 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:50,608 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:50,622 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:50:50,629 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:50:50,667 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:50,669 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:53,150 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5388 conjuctions. This might take some time... [2019-11-24 05:50:57,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:57,236 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:57,240 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:50:57,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-24 05:50:57,283 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:57,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:57,374 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:57,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:50:59,465 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5580 conjuctions. This might take some time... [2019-11-24 05:51:03,218 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 7348 conjuctions. This might take some time... [2019-11-24 05:51:08,799 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 8838 conjuctions. This might take some time...