java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:52,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:52,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:52,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:52,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:52,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:52,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:52,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:52,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:52,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:52,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:52,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:52,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:52,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:52,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:52,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:52,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:52,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:52,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:52,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:52,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:52,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:52,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:52,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:52,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:52,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:52,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:52,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:52,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:52,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:52,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:52,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:52,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:52,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:52,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:52,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:52,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:52,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:52,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:52,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:52,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:52,978 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:53,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:53,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:53,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:53,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:53,002 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:53,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:53,003 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:53,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:53,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:53,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:53,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:53,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:53,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:53,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:53,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:53,005 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:53,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:53,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:53,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:53,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:53,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:53,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:53,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:53,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:53,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:53,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:53,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:53,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:53,007 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:53,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:53,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:53,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:53,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:53,292 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:53,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:53,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdd083fe9/20fa2fdccbce438390fcb6eb87eb7318/FLAGb36e3df36 [2019-10-15 01:22:53,998 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:54,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:54,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdd083fe9/20fa2fdccbce438390fcb6eb87eb7318/FLAGb36e3df36 [2019-10-15 01:22:54,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdd083fe9/20fa2fdccbce438390fcb6eb87eb7318 [2019-10-15 01:22:54,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:54,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:54,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:54,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:54,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:54,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489c2918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:54, skipping insertion in model container [2019-10-15 01:22:54,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:54" (1/1) ... [2019-10-15 01:22:54,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:54,311 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:55,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:55,113 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:55,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:55,536 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:55,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:55 WrapperNode [2019-10-15 01:22:55,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:55,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:55,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:55,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:55,549 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:55" (1/1) ... [2019-10-15 01:22:55,549 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:55" (1/1) ... [2019-10-15 01:22:55,576 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:55" (1/1) ... [2019-10-15 01:22:55,577 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:55" (1/1) ... [2019-10-15 01:22:55,642 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:55" (1/1) ... [2019-10-15 01:22:55,681 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:55" (1/1) ... [2019-10-15 01:22:55,690 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:55" (1/1) ... [2019-10-15 01:22:55,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:55,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:55,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:55,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:55,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:55,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:55,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:55,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:55,781 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:55,782 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:55,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:57,680 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:57,681 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:57,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:57 BoogieIcfgContainer [2019-10-15 01:22:57,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:57,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:57,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:57,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:57,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:54" (1/3) ... [2019-10-15 01:22:57,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5129c958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:57, skipping insertion in model container [2019-10-15 01:22:57,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:55" (2/3) ... [2019-10-15 01:22:57,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5129c958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:57, skipping insertion in model container [2019-10-15 01:22:57,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:57" (3/3) ... [2019-10-15 01:22:57,691 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-15 01:22:57,702 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:57,711 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-15 01:22:57,723 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-15 01:22:57,753 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:57,753 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:57,753 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:57,754 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:57,754 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:57,754 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:57,754 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:57,754 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states. [2019-10-15 01:22:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:22:57,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:57,800 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] [2019-10-15 01:22:57,802 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1062699127, now seen corresponding path program 1 times [2019-10-15 01:22:57,817 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:57,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780753455] [2019-10-15 01:22:57,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:57,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,339 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:58,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780753455] [2019-10-15 01:22:58,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:58,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881696664] [2019-10-15 01:22:58,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:58,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:58,366 INFO L87 Difference]: Start difference. First operand 447 states. Second operand 3 states. [2019-10-15 01:22:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,556 INFO L93 Difference]: Finished difference Result 697 states and 1222 transitions. [2019-10-15 01:22:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:58,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 01:22:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,589 INFO L225 Difference]: With dead ends: 697 [2019-10-15 01:22:58,590 INFO L226 Difference]: Without dead ends: 550 [2019-10-15 01:22:58,594 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:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-15 01:22:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 544. [2019-10-15 01:22:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-15 01:22:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 719 transitions. [2019-10-15 01:22:58,707 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 719 transitions. Word has length 54 [2019-10-15 01:22:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:58,707 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 719 transitions. [2019-10-15 01:22:58,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 719 transitions. [2019-10-15 01:22:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:22:58,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:58,713 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] [2019-10-15 01:22:58,714 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash -194729860, now seen corresponding path program 1 times [2019-10-15 01:22:58,714 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:58,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601028046] [2019-10-15 01:22:58,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:58,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:58,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601028046] [2019-10-15 01:22:58,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:58,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:58,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935821120] [2019-10-15 01:22:58,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:58,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:58,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:58,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:58,883 INFO L87 Difference]: Start difference. First operand 544 states and 719 transitions. Second operand 3 states. [2019-10-15 01:22:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:58,980 INFO L93 Difference]: Finished difference Result 959 states and 1321 transitions. [2019-10-15 01:22:58,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:58,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 01:22:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:58,985 INFO L225 Difference]: With dead ends: 959 [2019-10-15 01:22:58,986 INFO L226 Difference]: Without dead ends: 718 [2019-10-15 01:22:58,988 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:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-15 01:22:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 712. [2019-10-15 01:22:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-15 01:22:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 957 transitions. [2019-10-15 01:22:59,026 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 957 transitions. Word has length 54 [2019-10-15 01:22:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:59,026 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 957 transitions. [2019-10-15 01:22:59,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 957 transitions. [2019-10-15 01:22:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:22:59,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,030 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] [2019-10-15 01:22:59,030 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash 509758050, now seen corresponding path program 1 times [2019-10-15 01:22:59,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491085376] [2019-10-15 01:22:59,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:59,269 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:59,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491085376] [2019-10-15 01:22:59,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:59,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:22:59,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141461504] [2019-10-15 01:22:59,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:22:59,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:59,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:22:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:22:59,272 INFO L87 Difference]: Start difference. First operand 712 states and 957 transitions. Second operand 10 states. [2019-10-15 01:23:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,442 INFO L93 Difference]: Finished difference Result 2252 states and 3213 transitions. [2019-10-15 01:23:01,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:23:01,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-15 01:23:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,456 INFO L225 Difference]: With dead ends: 2252 [2019-10-15 01:23:01,457 INFO L226 Difference]: Without dead ends: 2121 [2019-10-15 01:23:01,461 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:23:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-10-15 01:23:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 723. [2019-10-15 01:23:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-10-15 01:23:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 971 transitions. [2019-10-15 01:23:01,537 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 971 transitions. Word has length 54 [2019-10-15 01:23:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,539 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 971 transitions. [2019-10-15 01:23:01,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 971 transitions. [2019-10-15 01:23:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:01,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,542 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] [2019-10-15 01:23:01,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1420674109, now seen corresponding path program 1 times [2019-10-15 01:23:01,544 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294451591] [2019-10-15 01:23:01,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:01,663 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:01,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294451591] [2019-10-15 01:23:01,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:01,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:01,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292880009] [2019-10-15 01:23:01,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:01,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:01,666 INFO L87 Difference]: Start difference. First operand 723 states and 971 transitions. Second operand 3 states. [2019-10-15 01:23:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:01,841 INFO L93 Difference]: Finished difference Result 1390 states and 1920 transitions. [2019-10-15 01:23:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:01,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-15 01:23:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:01,849 INFO L225 Difference]: With dead ends: 1390 [2019-10-15 01:23:01,849 INFO L226 Difference]: Without dead ends: 1061 [2019-10-15 01:23:01,851 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,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-10-15 01:23:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1054. [2019-10-15 01:23:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-15 01:23:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1429 transitions. [2019-10-15 01:23:01,914 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1429 transitions. Word has length 55 [2019-10-15 01:23:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:01,915 INFO L462 AbstractCegarLoop]: Abstraction has 1054 states and 1429 transitions. [2019-10-15 01:23:01,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1429 transitions. [2019-10-15 01:23:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:01,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:01,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] [2019-10-15 01:23:01,919 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:01,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1526715040, now seen corresponding path program 1 times [2019-10-15 01:23:01,920 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:01,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334403106] [2019-10-15 01:23:01,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:01,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:02,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:23:02,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334403106] [2019-10-15 01:23:02,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:02,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:23:02,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254899094] [2019-10-15 01:23:02,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:23:02,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:02,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:23:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:23:02,173 INFO L87 Difference]: Start difference. First operand 1054 states and 1429 transitions. Second operand 12 states. [2019-10-15 01:23:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:06,321 INFO L93 Difference]: Finished difference Result 3825 states and 5350 transitions. [2019-10-15 01:23:06,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:06,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-10-15 01:23:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:06,346 INFO L225 Difference]: With dead ends: 3825 [2019-10-15 01:23:06,346 INFO L226 Difference]: Without dead ends: 3626 [2019-10-15 01:23:06,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:23:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-10-15 01:23:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 1070. [2019-10-15 01:23:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-10-15 01:23:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1452 transitions. [2019-10-15 01:23:06,513 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1452 transitions. Word has length 55 [2019-10-15 01:23:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:06,514 INFO L462 AbstractCegarLoop]: Abstraction has 1070 states and 1452 transitions. [2019-10-15 01:23:06,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:23:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1452 transitions. [2019-10-15 01:23:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:06,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:06,517 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] [2019-10-15 01:23:06,518 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash -822227130, now seen corresponding path program 1 times [2019-10-15 01:23:06,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:06,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757599716] [2019-10-15 01:23:06,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:06,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:06,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:06,705 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:06,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757599716] [2019-10-15 01:23:06,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:06,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:06,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998555087] [2019-10-15 01:23:06,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:06,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:06,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:06,708 INFO L87 Difference]: Start difference. First operand 1070 states and 1452 transitions. Second operand 9 states. [2019-10-15 01:23:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:08,120 INFO L93 Difference]: Finished difference Result 4052 states and 5667 transitions. [2019-10-15 01:23:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:08,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 01:23:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:08,137 INFO L225 Difference]: With dead ends: 4052 [2019-10-15 01:23:08,138 INFO L226 Difference]: Without dead ends: 3292 [2019-10-15 01:23:08,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:23:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-10-15 01:23:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2379. [2019-10-15 01:23:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-10-15 01:23:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3335 transitions. [2019-10-15 01:23:08,365 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3335 transitions. Word has length 55 [2019-10-15 01:23:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:08,365 INFO L462 AbstractCegarLoop]: Abstraction has 2379 states and 3335 transitions. [2019-10-15 01:23:08,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3335 transitions. [2019-10-15 01:23:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:08,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:08,369 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] [2019-10-15 01:23:08,370 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1576357576, now seen corresponding path program 1 times [2019-10-15 01:23:08,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:08,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125660653] [2019-10-15 01:23:08,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:08,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:08,539 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:08,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125660653] [2019-10-15 01:23:08,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:08,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:08,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893942855] [2019-10-15 01:23:08,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:08,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:08,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:08,542 INFO L87 Difference]: Start difference. First operand 2379 states and 3335 transitions. Second operand 10 states. [2019-10-15 01:23:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:10,378 INFO L93 Difference]: Finished difference Result 6160 states and 8682 transitions. [2019-10-15 01:23:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:23:10,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-15 01:23:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:10,406 INFO L225 Difference]: With dead ends: 6160 [2019-10-15 01:23:10,407 INFO L226 Difference]: Without dead ends: 5771 [2019-10-15 01:23:10,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:23:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2019-10-15 01:23:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 2390. [2019-10-15 01:23:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-10-15 01:23:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3349 transitions. [2019-10-15 01:23:10,659 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3349 transitions. Word has length 55 [2019-10-15 01:23:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:10,660 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 3349 transitions. [2019-10-15 01:23:10,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3349 transitions. [2019-10-15 01:23:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:10,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:10,664 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] [2019-10-15 01:23:10,664 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash 306490719, now seen corresponding path program 1 times [2019-10-15 01:23:10,665 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:10,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726820929] [2019-10-15 01:23:10,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:10,845 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:10,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726820929] [2019-10-15 01:23:10,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:10,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:10,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667018889] [2019-10-15 01:23:10,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:10,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:10,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:10,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:10,848 INFO L87 Difference]: Start difference. First operand 2390 states and 3349 transitions. Second operand 9 states. [2019-10-15 01:23:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:12,579 INFO L93 Difference]: Finished difference Result 6728 states and 9609 transitions. [2019-10-15 01:23:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:12,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 01:23:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:12,607 INFO L225 Difference]: With dead ends: 6728 [2019-10-15 01:23:12,607 INFO L226 Difference]: Without dead ends: 6175 [2019-10-15 01:23:12,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:23:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6175 states. [2019-10-15 01:23:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6175 to 2405. [2019-10-15 01:23:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-10-15 01:23:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3371 transitions. [2019-10-15 01:23:12,884 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3371 transitions. Word has length 56 [2019-10-15 01:23:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:12,885 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 3371 transitions. [2019-10-15 01:23:12,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3371 transitions. [2019-10-15 01:23:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:12,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:12,889 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] [2019-10-15 01:23:12,889 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash 943835121, now seen corresponding path program 1 times [2019-10-15 01:23:12,890 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:12,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499709960] [2019-10-15 01:23:12,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:12,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:13,009 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:13,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499709960] [2019-10-15 01:23:13,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:13,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:13,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775662106] [2019-10-15 01:23:13,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:13,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:13,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:13,014 INFO L87 Difference]: Start difference. First operand 2405 states and 3371 transitions. Second operand 6 states. [2019-10-15 01:23:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:13,709 INFO L93 Difference]: Finished difference Result 4144 states and 5874 transitions. [2019-10-15 01:23:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:13,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 01:23:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:13,720 INFO L225 Difference]: With dead ends: 4144 [2019-10-15 01:23:13,720 INFO L226 Difference]: Without dead ends: 2374 [2019-10-15 01:23:13,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-10-15 01:23:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1715. [2019-10-15 01:23:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-15 01:23:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-10-15 01:23:13,914 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-10-15 01:23:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:13,915 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-10-15 01:23:13,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-10-15 01:23:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:13,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:13,918 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] [2019-10-15 01:23:13,918 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 776701643, now seen corresponding path program 1 times [2019-10-15 01:23:13,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:13,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123306641] [2019-10-15 01:23:13,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:13,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:14,061 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:14,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123306641] [2019-10-15 01:23:14,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:14,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:14,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146969890] [2019-10-15 01:23:14,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:14,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:14,064 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 10 states. [2019-10-15 01:23:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:17,775 INFO L93 Difference]: Finished difference Result 8475 states and 12038 transitions. [2019-10-15 01:23:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:23:17,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-15 01:23:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:17,794 INFO L225 Difference]: With dead ends: 8475 [2019-10-15 01:23:17,794 INFO L226 Difference]: Without dead ends: 7941 [2019-10-15 01:23:17,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:23:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2019-10-15 01:23:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 1715. [2019-10-15 01:23:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-15 01:23:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2382 transitions. [2019-10-15 01:23:18,029 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2382 transitions. Word has length 56 [2019-10-15 01:23:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,030 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2382 transitions. [2019-10-15 01:23:18,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2382 transitions. [2019-10-15 01:23:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:18,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,032 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] [2019-10-15 01:23:18,032 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1768109464, now seen corresponding path program 1 times [2019-10-15 01:23:18,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196792297] [2019-10-15 01:23:18,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,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:23:18,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196792297] [2019-10-15 01:23:18,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:18,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919826192] [2019-10-15 01:23:18,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:18,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:18,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:18,173 INFO L87 Difference]: Start difference. First operand 1715 states and 2382 transitions. Second operand 9 states. [2019-10-15 01:23:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:19,864 INFO L93 Difference]: Finished difference Result 7739 states and 10931 transitions. [2019-10-15 01:23:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:19,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 01:23:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:19,879 INFO L225 Difference]: With dead ends: 7739 [2019-10-15 01:23:19,879 INFO L226 Difference]: Without dead ends: 6267 [2019-10-15 01:23:19,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:23:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6267 states. [2019-10-15 01:23:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6267 to 4343. [2019-10-15 01:23:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-10-15 01:23:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6162 transitions. [2019-10-15 01:23:20,446 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6162 transitions. Word has length 56 [2019-10-15 01:23:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:20,446 INFO L462 AbstractCegarLoop]: Abstraction has 4343 states and 6162 transitions. [2019-10-15 01:23:20,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6162 transitions. [2019-10-15 01:23:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:20,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:20,450 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] [2019-10-15 01:23:20,450 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1848159850, now seen corresponding path program 1 times [2019-10-15 01:23:20,451 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:20,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081409861] [2019-10-15 01:23:20,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:20,552 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:20,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081409861] [2019-10-15 01:23:20,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:20,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:20,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304600108] [2019-10-15 01:23:20,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:20,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:20,554 INFO L87 Difference]: Start difference. First operand 4343 states and 6162 transitions. Second operand 9 states. [2019-10-15 01:23:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:24,421 INFO L93 Difference]: Finished difference Result 16319 states and 22817 transitions. [2019-10-15 01:23:24,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:24,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 01:23:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:24,454 INFO L225 Difference]: With dead ends: 16319 [2019-10-15 01:23:24,454 INFO L226 Difference]: Without dead ends: 14835 [2019-10-15 01:23:24,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:23:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14835 states. [2019-10-15 01:23:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14835 to 4357. [2019-10-15 01:23:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4357 states. [2019-10-15 01:23:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6180 transitions. [2019-10-15 01:23:25,085 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6180 transitions. Word has length 56 [2019-10-15 01:23:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:25,085 INFO L462 AbstractCegarLoop]: Abstraction has 4357 states and 6180 transitions. [2019-10-15 01:23:25,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6180 transitions. [2019-10-15 01:23:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:25,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:25,088 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] [2019-10-15 01:23:25,089 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash -802335602, now seen corresponding path program 1 times [2019-10-15 01:23:25,089 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:25,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916616751] [2019-10-15 01:23:25,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:25,169 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:25,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916616751] [2019-10-15 01:23:25,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:25,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:25,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250776330] [2019-10-15 01:23:25,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:25,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:25,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:25,171 INFO L87 Difference]: Start difference. First operand 4357 states and 6180 transitions. Second operand 7 states. [2019-10-15 01:23:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:28,160 INFO L93 Difference]: Finished difference Result 15849 states and 22851 transitions. [2019-10-15 01:23:28,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:28,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-15 01:23:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:28,186 INFO L225 Difference]: With dead ends: 15849 [2019-10-15 01:23:28,186 INFO L226 Difference]: Without dead ends: 14955 [2019-10-15 01:23:28,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:23:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14955 states. [2019-10-15 01:23:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14955 to 4375. [2019-10-15 01:23:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2019-10-15 01:23:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 6204 transitions. [2019-10-15 01:23:29,048 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 6204 transitions. Word has length 56 [2019-10-15 01:23:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:29,048 INFO L462 AbstractCegarLoop]: Abstraction has 4375 states and 6204 transitions. [2019-10-15 01:23:29,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:23:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 6204 transitions. [2019-10-15 01:23:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:29,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:29,050 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] [2019-10-15 01:23:29,051 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash 766092927, now seen corresponding path program 1 times [2019-10-15 01:23:29,051 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:29,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915561902] [2019-10-15 01:23:29,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:29,144 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:29,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915561902] [2019-10-15 01:23:29,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:29,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:29,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607596644] [2019-10-15 01:23:29,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:29,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:29,146 INFO L87 Difference]: Start difference. First operand 4375 states and 6204 transitions. Second operand 7 states.