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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:37,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:37,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:37,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:37,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:37,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:37,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:37,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:37,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:37,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:37,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:37,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:37,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:37,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:37,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:37,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:37,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:37,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:37,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:37,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:37,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:37,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:37,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:37,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:37,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:37,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:37,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:37,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:37,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:37,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:37,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:37,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:37,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:37,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:37,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:37,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:37,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:37,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:37,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:37,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:37,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:37,422 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-10-15 01:22:37,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:37,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:37,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:37,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:37,438 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:37,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:37,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:37,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:37,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:37,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:37,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:37,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:37,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:37,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:37,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:37,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:37,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:37,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:37,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:37,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:37,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:37,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:37,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:37,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:37,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:37,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:37,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:37,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:37,443 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-10-15 01:22:37,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:37,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:37,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:37,790 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:37,791 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:37,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:37,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d2a0341/a8646e30efcb4e6283975b5af0b59866/FLAG4704754ff [2019-10-15 01:22:38,483 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:38,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:38,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d2a0341/a8646e30efcb4e6283975b5af0b59866/FLAG4704754ff [2019-10-15 01:22:38,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03d2a0341/a8646e30efcb4e6283975b5af0b59866 [2019-10-15 01:22:38,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:38,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:38,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:38,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:38,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:38,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:38" (1/1) ... [2019-10-15 01:22:38,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e072ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:38, skipping insertion in model container [2019-10-15 01:22:38,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:38" (1/1) ... [2019-10-15 01:22:38,728 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:38,801 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:39,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:39,439 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:39,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:39,958 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:39,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39 WrapperNode [2019-10-15 01:22:39,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:39,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:39,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:39,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:39,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:39,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:40,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:40,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:40,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (1/1) ... [2019-10-15 01:22:40,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:40,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:40,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:40,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:40,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (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-10-15 01:22:40,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:41,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:41,954 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:41,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:41 BoogieIcfgContainer [2019-10-15 01:22:41,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:41,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:41,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:41,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:41,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:38" (1/3) ... [2019-10-15 01:22:41,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546a4584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:41, skipping insertion in model container [2019-10-15 01:22:41,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:39" (2/3) ... [2019-10-15 01:22:41,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546a4584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:41, skipping insertion in model container [2019-10-15 01:22:41,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:41" (3/3) ... [2019-10-15 01:22:41,967 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:41,981 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:41,992 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:22:42,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:22:42,041 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:42,041 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:42,042 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:42,042 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:42,042 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:42,042 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:42,042 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:42,042 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-10-15 01:22:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:22:42,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:42,136 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:42,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1111774015, now seen corresponding path program 1 times [2019-10-15 01:22:42,156 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:42,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86875756] [2019-10-15 01:22:42,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:42,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:43,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86875756] [2019-10-15 01:22:43,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:43,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690271451] [2019-10-15 01:22:43,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:43,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:43,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:43,178 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 4 states. [2019-10-15 01:22:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,430 INFO L93 Difference]: Finished difference Result 1107 states and 1990 transitions. [2019-10-15 01:22:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:43,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-10-15 01:22:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,454 INFO L225 Difference]: With dead ends: 1107 [2019-10-15 01:22:43,455 INFO L226 Difference]: Without dead ends: 730 [2019-10-15 01:22:43,461 INFO L600 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-10-15 01:22:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-15 01:22:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 705. [2019-10-15 01:22:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-10-15 01:22:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1008 transitions. [2019-10-15 01:22:43,614 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1008 transitions. Word has length 143 [2019-10-15 01:22:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,615 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1008 transitions. [2019-10-15 01:22:43,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1008 transitions. [2019-10-15 01:22:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:22:43,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,629 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:43,629 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,631 INFO L82 PathProgramCache]: Analyzing trace with hash 25365273, now seen corresponding path program 1 times [2019-10-15 01:22:43,631 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22964118] [2019-10-15 01:22:43,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:43,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22964118] [2019-10-15 01:22:43,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:43,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:43,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440315066] [2019-10-15 01:22:43,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:43,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:43,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:43,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:43,806 INFO L87 Difference]: Start difference. First operand 705 states and 1008 transitions. Second operand 3 states. [2019-10-15 01:22:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:43,880 INFO L93 Difference]: Finished difference Result 2069 states and 2954 transitions. [2019-10-15 01:22:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:43,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-15 01:22:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:43,890 INFO L225 Difference]: With dead ends: 2069 [2019-10-15 01:22:43,890 INFO L226 Difference]: Without dead ends: 1396 [2019-10-15 01:22:43,897 INFO L600 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-10-15 01:22:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-10-15 01:22:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 707. [2019-10-15 01:22:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-10-15 01:22:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1010 transitions. [2019-10-15 01:22:43,963 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1010 transitions. Word has length 144 [2019-10-15 01:22:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:43,964 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1010 transitions. [2019-10-15 01:22:43,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1010 transitions. [2019-10-15 01:22:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:22:43,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:43,968 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:43,970 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash 166703234, now seen corresponding path program 1 times [2019-10-15 01:22:43,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:43,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089607176] [2019-10-15 01:22:43,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:43,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:44,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089607176] [2019-10-15 01:22:44,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:44,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005374278] [2019-10-15 01:22:44,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:44,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:44,180 INFO L87 Difference]: Start difference. First operand 707 states and 1010 transitions. Second operand 3 states. [2019-10-15 01:22:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,341 INFO L93 Difference]: Finished difference Result 1893 states and 2715 transitions. [2019-10-15 01:22:44,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:44,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-10-15 01:22:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,356 INFO L225 Difference]: With dead ends: 1893 [2019-10-15 01:22:44,356 INFO L226 Difference]: Without dead ends: 1368 [2019-10-15 01:22:44,359 INFO L600 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-10-15 01:22:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-10-15 01:22:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1343. [2019-10-15 01:22:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-10-15 01:22:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1911 transitions. [2019-10-15 01:22:44,457 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1911 transitions. Word has length 145 [2019-10-15 01:22:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,457 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1911 transitions. [2019-10-15 01:22:44,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1911 transitions. [2019-10-15 01:22:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:22:44,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,464 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:44,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 271175045, now seen corresponding path program 1 times [2019-10-15 01:22:44,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956083148] [2019-10-15 01:22:44,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:44,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956083148] [2019-10-15 01:22:44,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:44,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:44,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802415653] [2019-10-15 01:22:44,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:44,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:44,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:44,753 INFO L87 Difference]: Start difference. First operand 1343 states and 1911 transitions. Second operand 4 states. [2019-10-15 01:22:44,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:44,846 INFO L93 Difference]: Finished difference Result 2201 states and 3141 transitions. [2019-10-15 01:22:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:44,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-15 01:22:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:44,854 INFO L225 Difference]: With dead ends: 2201 [2019-10-15 01:22:44,854 INFO L226 Difference]: Without dead ends: 1030 [2019-10-15 01:22:44,856 INFO L600 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-10-15 01:22:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-10-15 01:22:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2019-10-15 01:22:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2019-10-15 01:22:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1457 transitions. [2019-10-15 01:22:44,915 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1457 transitions. Word has length 145 [2019-10-15 01:22:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:44,916 INFO L462 AbstractCegarLoop]: Abstraction has 1030 states and 1457 transitions. [2019-10-15 01:22:44,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1457 transitions. [2019-10-15 01:22:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:22:44,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:44,919 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:44,919 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1646821595, now seen corresponding path program 1 times [2019-10-15 01:22:44,920 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:44,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376814971] [2019-10-15 01:22:44,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:44,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:45,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376814971] [2019-10-15 01:22:45,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:45,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:22:45,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253326206] [2019-10-15 01:22:45,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:22:45,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:45,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:22:45,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:22:45,269 INFO L87 Difference]: Start difference. First operand 1030 states and 1457 transitions. Second operand 9 states. [2019-10-15 01:22:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:46,232 INFO L93 Difference]: Finished difference Result 2677 states and 3904 transitions. [2019-10-15 01:22:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:22:46,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-10-15 01:22:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:46,246 INFO L225 Difference]: With dead ends: 2677 [2019-10-15 01:22:46,247 INFO L226 Difference]: Without dead ends: 1818 [2019-10-15 01:22:46,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:22:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-10-15 01:22:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1496. [2019-10-15 01:22:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-10-15 01:22:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2138 transitions. [2019-10-15 01:22:46,396 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2138 transitions. Word has length 151 [2019-10-15 01:22:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:46,396 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2138 transitions. [2019-10-15 01:22:46,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:22:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2138 transitions. [2019-10-15 01:22:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:22:46,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:46,401 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:46,402 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:46,402 INFO L82 PathProgramCache]: Analyzing trace with hash 154501339, now seen corresponding path program 1 times [2019-10-15 01:22:46,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:46,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419096170] [2019-10-15 01:22:46,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:46,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:46,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419096170] [2019-10-15 01:22:46,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:46,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:46,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585013005] [2019-10-15 01:22:46,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:46,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:46,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:46,583 INFO L87 Difference]: Start difference. First operand 1496 states and 2138 transitions. Second operand 4 states. [2019-10-15 01:22:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:46,841 INFO L93 Difference]: Finished difference Result 2950 states and 4367 transitions. [2019-10-15 01:22:46,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:46,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-15 01:22:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:46,855 INFO L225 Difference]: With dead ends: 2950 [2019-10-15 01:22:46,856 INFO L226 Difference]: Without dead ends: 2430 [2019-10-15 01:22:46,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-10-15 01:22:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2019-10-15 01:22:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2428. [2019-10-15 01:22:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-10-15 01:22:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3512 transitions. [2019-10-15 01:22:47,012 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3512 transitions. Word has length 151 [2019-10-15 01:22:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:47,013 INFO L462 AbstractCegarLoop]: Abstraction has 2428 states and 3512 transitions. [2019-10-15 01:22:47,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3512 transitions. [2019-10-15 01:22:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:22:47,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:47,019 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:47,020 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2031358202, now seen corresponding path program 1 times [2019-10-15 01:22:47,021 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:47,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721766369] [2019-10-15 01:22:47,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:47,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721766369] [2019-10-15 01:22:47,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:47,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:47,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333172211] [2019-10-15 01:22:47,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:47,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:47,309 INFO L87 Difference]: Start difference. First operand 2428 states and 3512 transitions. Second operand 4 states. [2019-10-15 01:22:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:47,614 INFO L93 Difference]: Finished difference Result 6277 states and 9070 transitions. [2019-10-15 01:22:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:47,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-15 01:22:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:47,634 INFO L225 Difference]: With dead ends: 6277 [2019-10-15 01:22:47,634 INFO L226 Difference]: Without dead ends: 3872 [2019-10-15 01:22:47,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2019-10-15 01:22:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3850. [2019-10-15 01:22:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3850 states. [2019-10-15 01:22:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 5507 transitions. [2019-10-15 01:22:47,910 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 5507 transitions. Word has length 151 [2019-10-15 01:22:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:47,911 INFO L462 AbstractCegarLoop]: Abstraction has 3850 states and 5507 transitions. [2019-10-15 01:22:47,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 5507 transitions. [2019-10-15 01:22:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:22:47,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:47,917 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:47,918 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash 30760331, now seen corresponding path program 1 times [2019-10-15 01:22:47,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:47,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356597302] [2019-10-15 01:22:47,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:47,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:48,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356597302] [2019-10-15 01:22:48,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:48,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:48,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322251528] [2019-10-15 01:22:48,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:48,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:48,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:48,024 INFO L87 Difference]: Start difference. First operand 3850 states and 5507 transitions. Second operand 3 states. [2019-10-15 01:22:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:48,414 INFO L93 Difference]: Finished difference Result 10830 states and 15529 transitions. [2019-10-15 01:22:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:48,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-15 01:22:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:48,451 INFO L225 Difference]: With dead ends: 10830 [2019-10-15 01:22:48,452 INFO L226 Difference]: Without dead ends: 7331 [2019-10-15 01:22:48,462 INFO L600 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-10-15 01:22:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2019-10-15 01:22:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7311. [2019-10-15 01:22:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7311 states. [2019-10-15 01:22:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7311 states to 7311 states and 10356 transitions. [2019-10-15 01:22:48,954 INFO L78 Accepts]: Start accepts. Automaton has 7311 states and 10356 transitions. Word has length 153 [2019-10-15 01:22:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:48,956 INFO L462 AbstractCegarLoop]: Abstraction has 7311 states and 10356 transitions. [2019-10-15 01:22:48,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7311 states and 10356 transitions. [2019-10-15 01:22:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:22:48,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:48,968 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:48,969 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1476891570, now seen corresponding path program 1 times [2019-10-15 01:22:48,970 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:48,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267452238] [2019-10-15 01:22:48,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:48,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:48,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:49,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267452238] [2019-10-15 01:22:49,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:49,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:49,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579255934] [2019-10-15 01:22:49,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:49,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:49,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:49,132 INFO L87 Difference]: Start difference. First operand 7311 states and 10356 transitions. Second operand 4 states. [2019-10-15 01:22:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:49,614 INFO L93 Difference]: Finished difference Result 11608 states and 16445 transitions. [2019-10-15 01:22:49,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:49,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-15 01:22:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:49,664 INFO L225 Difference]: With dead ends: 11608 [2019-10-15 01:22:49,664 INFO L226 Difference]: Without dead ends: 5961 [2019-10-15 01:22:49,679 INFO L600 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-10-15 01:22:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2019-10-15 01:22:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5961. [2019-10-15 01:22:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5961 states. [2019-10-15 01:22:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 8411 transitions. [2019-10-15 01:22:50,006 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 8411 transitions. Word has length 153 [2019-10-15 01:22:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:50,006 INFO L462 AbstractCegarLoop]: Abstraction has 5961 states and 8411 transitions. [2019-10-15 01:22:50,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 8411 transitions. [2019-10-15 01:22:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:22:50,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:50,016 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:50,016 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash 770800706, now seen corresponding path program 1 times [2019-10-15 01:22:50,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:50,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703747586] [2019-10-15 01:22:50,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:50,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:50,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703747586] [2019-10-15 01:22:50,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:50,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:22:50,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179004522] [2019-10-15 01:22:50,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:22:50,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:22:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:22:50,303 INFO L87 Difference]: Start difference. First operand 5961 states and 8411 transitions. Second operand 8 states. [2019-10-15 01:22:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:52,117 INFO L93 Difference]: Finished difference Result 20223 states and 30063 transitions. [2019-10-15 01:22:52,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:22:52,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-10-15 01:22:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:52,163 INFO L225 Difference]: With dead ends: 20223 [2019-10-15 01:22:52,163 INFO L226 Difference]: Without dead ends: 17597 [2019-10-15 01:22:52,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:22:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17597 states. [2019-10-15 01:22:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17597 to 16970. [2019-10-15 01:22:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16970 states. [2019-10-15 01:22:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16970 states to 16970 states and 24854 transitions. [2019-10-15 01:22:53,196 INFO L78 Accepts]: Start accepts. Automaton has 16970 states and 24854 transitions. Word has length 159 [2019-10-15 01:22:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:53,196 INFO L462 AbstractCegarLoop]: Abstraction has 16970 states and 24854 transitions. [2019-10-15 01:22:53,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:22:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 16970 states and 24854 transitions. [2019-10-15 01:22:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:22:53,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:53,215 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:53,216 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1027311707, now seen corresponding path program 1 times [2019-10-15 01:22:53,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:53,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332538873] [2019-10-15 01:22:53,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:53,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:53,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332538873] [2019-10-15 01:22:53,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:53,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:53,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453154388] [2019-10-15 01:22:53,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:53,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:53,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:53,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:53,417 INFO L87 Difference]: Start difference. First operand 16970 states and 24854 transitions. Second operand 4 states. [2019-10-15 01:22:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:55,626 INFO L93 Difference]: Finished difference Result 49667 states and 72598 transitions. [2019-10-15 01:22:55,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:22:55,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-10-15 01:22:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:55,702 INFO L225 Difference]: With dead ends: 49667 [2019-10-15 01:22:55,702 INFO L226 Difference]: Without dead ends: 32740 [2019-10-15 01:22:55,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32740 states. [2019-10-15 01:22:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32740 to 32684. [2019-10-15 01:22:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-10-15 01:22:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47291 transitions. [2019-10-15 01:22:57,413 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47291 transitions. Word has length 159 [2019-10-15 01:22:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:57,413 INFO L462 AbstractCegarLoop]: Abstraction has 32684 states and 47291 transitions. [2019-10-15 01:22:57,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47291 transitions. [2019-10-15 01:22:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:22:57,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:57,440 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:22:57,440 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1202093437, now seen corresponding path program 1 times [2019-10-15 01:22:57,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:57,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143323017] [2019-10-15 01:22:57,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:57,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143323017] [2019-10-15 01:22:57,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:57,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:57,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325988267] [2019-10-15 01:22:57,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:57,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:57,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:57,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:57,504 INFO L87 Difference]: Start difference. First operand 32684 states and 47291 transitions. Second operand 3 states. [2019-10-15 01:23:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:00,904 INFO L93 Difference]: Finished difference Result 97858 states and 141624 transitions. [2019-10-15 01:23:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:00,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-15 01:23:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,012 INFO L225 Difference]: With dead ends: 97858 [2019-10-15 01:23:01,012 INFO L226 Difference]: Without dead ends: 65280 [2019-10-15 01:23:01,073 INFO L600 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-10-15 01:23:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65280 states. [2019-10-15 01:23:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65280 to 32690. [2019-10-15 01:23:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-10-15 01:23:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 47297 transitions. [2019-10-15 01:23:02,931 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 47297 transitions. Word has length 160 [2019-10-15 01:23:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:02,931 INFO L462 AbstractCegarLoop]: Abstraction has 32690 states and 47297 transitions. [2019-10-15 01:23:02,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 47297 transitions. [2019-10-15 01:23:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:23:02,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:02,956 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:02,956 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1346353852, now seen corresponding path program 1 times [2019-10-15 01:23:02,957 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:02,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747436211] [2019-10-15 01:23:02,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:03,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747436211] [2019-10-15 01:23:03,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:03,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:03,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104239309] [2019-10-15 01:23:03,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:03,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:03,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:03,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:03,084 INFO L87 Difference]: Start difference. First operand 32690 states and 47297 transitions. Second operand 4 states. [2019-10-15 01:23:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:04,755 INFO L93 Difference]: Finished difference Result 65338 states and 94538 transitions. [2019-10-15 01:23:04,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:04,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:23:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:04,796 INFO L225 Difference]: With dead ends: 65338 [2019-10-15 01:23:04,796 INFO L226 Difference]: Without dead ends: 32684 [2019-10-15 01:23:04,831 INFO L600 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-10-15 01:23:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32684 states. [2019-10-15 01:23:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32684 to 32684. [2019-10-15 01:23:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-10-15 01:23:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47285 transitions. [2019-10-15 01:23:07,433 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47285 transitions. Word has length 161 [2019-10-15 01:23:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:07,434 INFO L462 AbstractCegarLoop]: Abstraction has 32684 states and 47285 transitions. [2019-10-15 01:23:07,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47285 transitions. [2019-10-15 01:23:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:23:07,452 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:07,452 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:07,453 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:07,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:07,453 INFO L82 PathProgramCache]: Analyzing trace with hash 913057412, now seen corresponding path program 1 times [2019-10-15 01:23:07,453 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:07,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592130692] [2019-10-15 01:23:07,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:07,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:07,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592130692] [2019-10-15 01:23:07,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:07,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:07,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002144141] [2019-10-15 01:23:07,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:07,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:07,557 INFO L87 Difference]: Start difference. First operand 32684 states and 47285 transitions. Second operand 3 states. [2019-10-15 01:23:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:10,000 INFO L93 Difference]: Finished difference Result 80670 states and 116554 transitions. [2019-10-15 01:23:10,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:10,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-10-15 01:23:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:10,056 INFO L225 Difference]: With dead ends: 80670 [2019-10-15 01:23:10,056 INFO L226 Difference]: Without dead ends: 48670 [2019-10-15 01:23:10,089 INFO L600 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-10-15 01:23:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48670 states. [2019-10-15 01:23:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48670 to 48614. [2019-10-15 01:23:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48614 states. [2019-10-15 01:23:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48614 states to 48614 states and 69220 transitions. [2019-10-15 01:23:12,454 INFO L78 Accepts]: Start accepts. Automaton has 48614 states and 69220 transitions. Word has length 161 [2019-10-15 01:23:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:12,454 INFO L462 AbstractCegarLoop]: Abstraction has 48614 states and 69220 transitions. [2019-10-15 01:23:12,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 48614 states and 69220 transitions. [2019-10-15 01:23:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:23:12,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:12,472 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:12,472 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -607664097, now seen corresponding path program 1 times [2019-10-15 01:23:12,472 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:12,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310645816] [2019-10-15 01:23:12,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat