/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:25,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:25,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:25,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:25,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:25,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:25,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:25,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:25,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:25,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:25,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:25,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:25,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:25,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:25,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:25,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:25,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:25,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:25,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:25,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:25,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:25,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:25,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:25,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:25,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:25,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:25,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:25,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:25,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:25,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:25,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:25,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:25,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:25,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:25,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:25,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:25,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:25,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:25,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:25,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:25,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:25,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:05:25,460 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:25,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:25,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:25,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:25,462 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:25,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:25,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:25,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:25,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:25,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:25,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:25,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:25,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:25,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:25,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:25,469 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:25,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:25,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:25,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:25,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:25,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:25,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:25,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:25,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:25,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:25,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:25,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:25,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:25,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:05:25,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:25,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:25,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:25,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:25,792 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:25,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:05:25,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85b4e96b/6ad958b27c084dfd9b5a4f23642de16c/FLAG4dfc64234 [2019-11-07 01:05:26,447 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:26,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:05:26,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85b4e96b/6ad958b27c084dfd9b5a4f23642de16c/FLAG4dfc64234 [2019-11-07 01:05:26,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85b4e96b/6ad958b27c084dfd9b5a4f23642de16c [2019-11-07 01:05:26,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:26,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:26,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:26,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:26,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:26,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:26" (1/1) ... [2019-11-07 01:05:26,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d19334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:26, skipping insertion in model container [2019-11-07 01:05:26,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:26" (1/1) ... [2019-11-07 01:05:26,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:26,801 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:27,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:27,574 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:27,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:27,990 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:27,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27 WrapperNode [2019-11-07 01:05:27,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:27,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:27,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:27,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:28,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (1/1) ... [2019-11-07 01:05:28,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (1/1) ... [2019-11-07 01:05:28,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (1/1) ... [2019-11-07 01:05:28,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (1/1) ... [2019-11-07 01:05:28,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (1/1) ... [2019-11-07 01:05:28,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (1/1) ... [2019-11-07 01:05:28,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (1/1) ... [2019-11-07 01:05:28,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:28,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:28,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:28,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:28,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (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-07 01:05:28,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:28,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:28,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:28,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:28,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:28,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:30,315 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:30,316 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:30,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:30 BoogieIcfgContainer [2019-11-07 01:05:30,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:30,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:30,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:30,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:30,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:26" (1/3) ... [2019-11-07 01:05:30,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c9d211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:30, skipping insertion in model container [2019-11-07 01:05:30,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:27" (2/3) ... [2019-11-07 01:05:30,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c9d211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:30, skipping insertion in model container [2019-11-07 01:05:30,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:30" (3/3) ... [2019-11-07 01:05:30,333 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 01:05:30,343 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:30,372 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-07 01:05:30,390 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-07 01:05:30,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:30,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:30,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:30,433 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:30,433 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:30,433 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:30,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:30,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states. [2019-11-07 01:05:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:05:30,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:30,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:30,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1062699127, now seen corresponding path program 1 times [2019-11-07 01:05:30,499 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:30,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403660656] [2019-11-07 01:05:30,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:30,957 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-07 01:05:30,958 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403660656] [2019-11-07 01:05:30,959 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:30,959 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:30,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595065883] [2019-11-07 01:05:30,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:30,968 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:30,986 INFO L87 Difference]: Start difference. First operand 447 states. Second operand 3 states. [2019-11-07 01:05:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:31,149 INFO L93 Difference]: Finished difference Result 697 states and 1222 transitions. [2019-11-07 01:05:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:31,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-07 01:05:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:31,183 INFO L225 Difference]: With dead ends: 697 [2019-11-07 01:05:31,183 INFO L226 Difference]: Without dead ends: 550 [2019-11-07 01:05:31,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-07 01:05:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 544. [2019-11-07 01:05:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-07 01:05:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 719 transitions. [2019-11-07 01:05:31,319 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 719 transitions. Word has length 54 [2019-11-07 01:05:31,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:31,320 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 719 transitions. [2019-11-07 01:05:31,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 719 transitions. [2019-11-07 01:05:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:05:31,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:31,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:31,331 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:31,332 INFO L82 PathProgramCache]: Analyzing trace with hash -194729860, now seen corresponding path program 1 times [2019-11-07 01:05:31,332 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:31,332 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749540528] [2019-11-07 01:05:31,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:31,444 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-07 01:05:31,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749540528] [2019-11-07 01:05:31,444 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:31,445 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:31,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466721010] [2019-11-07 01:05:31,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:31,448 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:31,449 INFO L87 Difference]: Start difference. First operand 544 states and 719 transitions. Second operand 3 states. [2019-11-07 01:05:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:31,545 INFO L93 Difference]: Finished difference Result 959 states and 1321 transitions. [2019-11-07 01:05:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:31,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-07 01:05:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:31,552 INFO L225 Difference]: With dead ends: 959 [2019-11-07 01:05:31,553 INFO L226 Difference]: Without dead ends: 718 [2019-11-07 01:05:31,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-11-07 01:05:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 712. [2019-11-07 01:05:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-11-07 01:05:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 957 transitions. [2019-11-07 01:05:31,623 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 957 transitions. Word has length 54 [2019-11-07 01:05:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:31,624 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 957 transitions. [2019-11-07 01:05:31,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 957 transitions. [2019-11-07 01:05:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:05:31,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:31,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:31,630 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash 509758050, now seen corresponding path program 1 times [2019-11-07 01:05:31,635 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:31,635 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474874808] [2019-11-07 01:05:31,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:31,913 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-07 01:05:31,914 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474874808] [2019-11-07 01:05:31,914 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:31,914 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:05:31,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786361309] [2019-11-07 01:05:31,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:05:31,915 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:31,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:05:31,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:05:31,916 INFO L87 Difference]: Start difference. First operand 712 states and 957 transitions. Second operand 10 states. [2019-11-07 01:05:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,089 INFO L93 Difference]: Finished difference Result 2252 states and 3213 transitions. [2019-11-07 01:05:34,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 01:05:34,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-07 01:05:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,102 INFO L225 Difference]: With dead ends: 2252 [2019-11-07 01:05:34,102 INFO L226 Difference]: Without dead ends: 2121 [2019-11-07 01:05:34,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-11-07 01:05:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-07 01:05:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 723. [2019-11-07 01:05:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-07 01:05:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 971 transitions. [2019-11-07 01:05:34,173 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 971 transitions. Word has length 54 [2019-11-07 01:05:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:34,174 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 971 transitions. [2019-11-07 01:05:34,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:05:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 971 transitions. [2019-11-07 01:05:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:05:34,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:34,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:34,177 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1420674109, now seen corresponding path program 1 times [2019-11-07 01:05:34,178 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:34,178 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276701189] [2019-11-07 01:05:34,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:34,299 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-07 01:05:34,299 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276701189] [2019-11-07 01:05:34,300 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:34,300 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:34,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570379792] [2019-11-07 01:05:34,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:34,301 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:34,302 INFO L87 Difference]: Start difference. First operand 723 states and 971 transitions. Second operand 3 states. [2019-11-07 01:05:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:34,429 INFO L93 Difference]: Finished difference Result 1390 states and 1920 transitions. [2019-11-07 01:05:34,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:34,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-07 01:05:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:34,436 INFO L225 Difference]: With dead ends: 1390 [2019-11-07 01:05:34,437 INFO L226 Difference]: Without dead ends: 1061 [2019-11-07 01:05:34,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:34,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-11-07 01:05:34,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1054. [2019-11-07 01:05:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-11-07 01:05:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1429 transitions. [2019-11-07 01:05:34,511 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1429 transitions. Word has length 55 [2019-11-07 01:05:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:34,512 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1429 transitions. [2019-11-07 01:05:34,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1429 transitions. [2019-11-07 01:05:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:05:34,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:34,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:34,516 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1526715040, now seen corresponding path program 1 times [2019-11-07 01:05:34,517 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:34,518 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858528992] [2019-11-07 01:05:34,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:34,818 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-07 01:05:34,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858528992] [2019-11-07 01:05:34,821 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:34,821 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 01:05:34,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362063299] [2019-11-07 01:05:34,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 01:05:34,823 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 01:05:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:05:34,826 INFO L87 Difference]: Start difference. First operand 1054 states and 1429 transitions. Second operand 12 states. [2019-11-07 01:05:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:38,481 INFO L93 Difference]: Finished difference Result 3825 states and 5350 transitions. [2019-11-07 01:05:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 01:05:38,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-11-07 01:05:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:38,500 INFO L225 Difference]: With dead ends: 3825 [2019-11-07 01:05:38,500 INFO L226 Difference]: Without dead ends: 3626 [2019-11-07 01:05:38,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-11-07 01:05:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-11-07 01:05:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 1070. [2019-11-07 01:05:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-11-07 01:05:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1452 transitions. [2019-11-07 01:05:38,605 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1452 transitions. Word has length 55 [2019-11-07 01:05:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:38,605 INFO L462 AbstractCegarLoop]: Abstraction has 1070 states and 1452 transitions. [2019-11-07 01:05:38,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 01:05:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1452 transitions. [2019-11-07 01:05:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:05:38,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:38,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:38,608 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:38,609 INFO L82 PathProgramCache]: Analyzing trace with hash -822227130, now seen corresponding path program 1 times [2019-11-07 01:05:38,609 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:38,609 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086928529] [2019-11-07 01:05:38,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:38,753 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-07 01:05:38,753 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086928529] [2019-11-07 01:05:38,753 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:38,754 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:38,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749815383] [2019-11-07 01:05:38,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:38,755 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:38,755 INFO L87 Difference]: Start difference. First operand 1070 states and 1452 transitions. Second operand 9 states. [2019-11-07 01:05:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:40,121 INFO L93 Difference]: Finished difference Result 4052 states and 5667 transitions. [2019-11-07 01:05:40,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:05:40,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 01:05:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:40,136 INFO L225 Difference]: With dead ends: 4052 [2019-11-07 01:05:40,136 INFO L226 Difference]: Without dead ends: 3292 [2019-11-07 01:05:40,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:05:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-11-07 01:05:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2379. [2019-11-07 01:05:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-11-07 01:05:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3335 transitions. [2019-11-07 01:05:40,344 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3335 transitions. Word has length 55 [2019-11-07 01:05:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:40,344 INFO L462 AbstractCegarLoop]: Abstraction has 2379 states and 3335 transitions. [2019-11-07 01:05:40,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3335 transitions. [2019-11-07 01:05:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:05:40,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:40,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:40,352 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1576357576, now seen corresponding path program 1 times [2019-11-07 01:05:40,353 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:40,356 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930241071] [2019-11-07 01:05:40,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:40,544 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-07 01:05:40,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930241071] [2019-11-07 01:05:40,544 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:40,544 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:05:40,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413868716] [2019-11-07 01:05:40,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:05:40,545 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:05:40,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:05:40,546 INFO L87 Difference]: Start difference. First operand 2379 states and 3335 transitions. Second operand 10 states. [2019-11-07 01:05:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:42,342 INFO L93 Difference]: Finished difference Result 6160 states and 8682 transitions. [2019-11-07 01:05:42,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:05:42,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-11-07 01:05:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:42,372 INFO L225 Difference]: With dead ends: 6160 [2019-11-07 01:05:42,373 INFO L226 Difference]: Without dead ends: 5771 [2019-11-07 01:05:42,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-07 01:05:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2019-11-07 01:05:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 2390. [2019-11-07 01:05:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-11-07 01:05:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3349 transitions. [2019-11-07 01:05:42,631 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3349 transitions. Word has length 55 [2019-11-07 01:05:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:42,633 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 3349 transitions. [2019-11-07 01:05:42,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:05:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3349 transitions. [2019-11-07 01:05:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:42,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:42,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:42,637 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash 306490719, now seen corresponding path program 1 times [2019-11-07 01:05:42,638 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:42,638 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548299742] [2019-11-07 01:05:42,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:42,784 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-07 01:05:42,785 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548299742] [2019-11-07 01:05:42,785 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:42,785 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:42,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632252176] [2019-11-07 01:05:42,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:42,786 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:42,787 INFO L87 Difference]: Start difference. First operand 2390 states and 3349 transitions. Second operand 9 states. [2019-11-07 01:05:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:44,483 INFO L93 Difference]: Finished difference Result 6728 states and 9609 transitions. [2019-11-07 01:05:44,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:05:44,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-07 01:05:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:44,508 INFO L225 Difference]: With dead ends: 6728 [2019-11-07 01:05:44,509 INFO L226 Difference]: Without dead ends: 6175 [2019-11-07 01:05:44,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-11-07 01:05:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6175 states. [2019-11-07 01:05:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6175 to 2405. [2019-11-07 01:05:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-11-07 01:05:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3371 transitions. [2019-11-07 01:05:44,774 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3371 transitions. Word has length 56 [2019-11-07 01:05:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:44,774 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 3371 transitions. [2019-11-07 01:05:44,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3371 transitions. [2019-11-07 01:05:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:44,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:44,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:44,778 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 943835121, now seen corresponding path program 1 times [2019-11-07 01:05:44,779 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:44,779 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377990866] [2019-11-07 01:05:44,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:44,879 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-07 01:05:44,879 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377990866] [2019-11-07 01:05:44,881 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:44,881 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:44,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247492024] [2019-11-07 01:05:44,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:44,882 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:44,882 INFO L87 Difference]: Start difference. First operand 2405 states and 3371 transitions. Second operand 6 states. [2019-11-07 01:05:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:45,751 INFO L93 Difference]: Finished difference Result 4144 states and 5874 transitions. [2019-11-07 01:05:45,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:45,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-07 01:05:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:45,774 INFO L225 Difference]: With dead ends: 4144 [2019-11-07 01:05:45,774 INFO L226 Difference]: Without dead ends: 2374 [2019-11-07 01:05:45,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-11-07 01:05:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1715. [2019-11-07 01:05:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-11-07 01:05:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-11-07 01:05:45,993 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-11-07 01:05:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:45,993 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-11-07 01:05:45,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-11-07 01:05:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:45,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:45,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:45,999 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 776701643, now seen corresponding path program 1 times [2019-11-07 01:05:46,000 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:46,000 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575867920] [2019-11-07 01:05:46,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:46,123 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-07 01:05:46,124 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575867920] [2019-11-07 01:05:46,124 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:46,125 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:05:46,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338950045] [2019-11-07 01:05:46,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:05:46,129 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:05:46,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:05:46,130 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 10 states. [2019-11-07 01:05:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:49,849 INFO L93 Difference]: Finished difference Result 8475 states and 12038 transitions. [2019-11-07 01:05:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-07 01:05:49,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-11-07 01:05:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:49,865 INFO L225 Difference]: With dead ends: 8475 [2019-11-07 01:05:49,866 INFO L226 Difference]: Without dead ends: 7941 [2019-11-07 01:05:49,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-11-07 01:05:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2019-11-07 01:05:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 1715. [2019-11-07 01:05:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-11-07 01:05:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-11-07 01:05:50,188 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-11-07 01:05:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:50,188 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-11-07 01:05:50,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:05:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-11-07 01:05:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:50,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:50,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:50,191 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1768109464, now seen corresponding path program 1 times [2019-11-07 01:05:50,192 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:50,192 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45896514] [2019-11-07 01:05:50,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:50,305 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-07 01:05:50,305 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45896514] [2019-11-07 01:05:50,305 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:50,305 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:50,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506401076] [2019-11-07 01:05:50,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:50,306 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:50,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:50,307 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 9 states. [2019-11-07 01:05:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:52,045 INFO L93 Difference]: Finished difference Result 7739 states and 10931 transitions. [2019-11-07 01:05:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:05:52,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-07 01:05:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:52,059 INFO L225 Difference]: With dead ends: 7739 [2019-11-07 01:05:52,059 INFO L226 Difference]: Without dead ends: 6267 [2019-11-07 01:05:52,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:05:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6267 states. [2019-11-07 01:05:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6267 to 4343. [2019-11-07 01:05:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-11-07 01:05:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6162 transitions. [2019-11-07 01:05:52,666 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6162 transitions. Word has length 56 [2019-11-07 01:05:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:52,666 INFO L462 AbstractCegarLoop]: Abstraction has 4343 states and 6162 transitions. [2019-11-07 01:05:52,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6162 transitions. [2019-11-07 01:05:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:52,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:52,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:52,672 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1848159850, now seen corresponding path program 1 times [2019-11-07 01:05:52,673 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:52,673 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437234921] [2019-11-07 01:05:52,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:52,773 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-07 01:05:52,774 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437234921] [2019-11-07 01:05:52,774 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:52,774 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:52,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485627090] [2019-11-07 01:05:52,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:52,775 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:52,776 INFO L87 Difference]: Start difference. First operand 4343 states and 6162 transitions. Second operand 9 states. [2019-11-07 01:05:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:56,770 INFO L93 Difference]: Finished difference Result 16319 states and 22817 transitions. [2019-11-07 01:05:56,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 01:05:56,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-07 01:05:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:56,799 INFO L225 Difference]: With dead ends: 16319 [2019-11-07 01:05:56,799 INFO L226 Difference]: Without dead ends: 14835 [2019-11-07 01:05:56,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-11-07 01:05:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14835 states. [2019-11-07 01:05:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14835 to 4357. [2019-11-07 01:05:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4357 states. [2019-11-07 01:05:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6180 transitions. [2019-11-07 01:05:57,549 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6180 transitions. Word has length 56 [2019-11-07 01:05:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:57,549 INFO L462 AbstractCegarLoop]: Abstraction has 4357 states and 6180 transitions. [2019-11-07 01:05:57,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6180 transitions. [2019-11-07 01:05:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:57,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:57,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:57,553 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash -802335602, now seen corresponding path program 1 times [2019-11-07 01:05:57,554 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:57,554 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096786423] [2019-11-07 01:05:57,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:57,636 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-07 01:05:57,636 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096786423] [2019-11-07 01:05:57,637 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:57,637 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:05:57,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361534763] [2019-11-07 01:05:57,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:05:57,643 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:05:57,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:05:57,644 INFO L87 Difference]: Start difference. First operand 4357 states and 6180 transitions. Second operand 7 states. [2019-11-07 01:06:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:01,005 INFO L93 Difference]: Finished difference Result 15849 states and 22851 transitions. [2019-11-07 01:06:01,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:06:01,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-07 01:06:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:01,028 INFO L225 Difference]: With dead ends: 15849 [2019-11-07 01:06:01,028 INFO L226 Difference]: Without dead ends: 14955 [2019-11-07 01:06:01,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-07 01:06:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14955 states. [2019-11-07 01:06:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14955 to 4375. [2019-11-07 01:06:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2019-11-07 01:06:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6204 transitions. [2019-11-07 01:06:01,837 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6204 transitions. Word has length 56 [2019-11-07 01:06:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:01,838 INFO L462 AbstractCegarLoop]: Abstraction has 4375 states and 6204 transitions. [2019-11-07 01:06:01,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:06:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6204 transitions. [2019-11-07 01:06:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 01:06:01,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:01,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:01,841 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:01,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash 766092927, now seen corresponding path program 1 times [2019-11-07 01:06:01,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:01,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119110686] [2019-11-07 01:06:01,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:01,928 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-07 01:06:01,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119110686] [2019-11-07 01:06:01,928 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:01,928 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:06:01,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973063075] [2019-11-07 01:06:01,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:06:01,929 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:06:01,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:06:01,930 INFO L87 Difference]: Start difference. First operand 4375 states and 6204 transitions. Second operand 7 states.