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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:52,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:52,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:52,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:52,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:52,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:52,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:52,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:52,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:52,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:52,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:52,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:52,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:52,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:52,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:52,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:52,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:52,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:52,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:52,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:52,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:52,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:52,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:52,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:52,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:52,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:52,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:52,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:52,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:52,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:52,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:52,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:52,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:52,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:52,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:52,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:52,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:52,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:52,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:52,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:52,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:52,175 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:52,192 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:52,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:52,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:52,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:52,194 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:52,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:52,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:52,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:52,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:52,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:52,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:52,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:52,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:52,197 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:52,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:52,198 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:52,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:52,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:52,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:52,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:52,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:52,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:52,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:52,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:52,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:52,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:52,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:52,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:52,201 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:52,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:52,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:52,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:52,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:52,511 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:52,512 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:22:52,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5b863be/8612500e9b844c9c996e7048c97fbd0e/FLAG6255295d7 [2019-10-15 01:22:53,300 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:53,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:22:53,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5b863be/8612500e9b844c9c996e7048c97fbd0e/FLAG6255295d7 [2019-10-15 01:22:53,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5b863be/8612500e9b844c9c996e7048c97fbd0e [2019-10-15 01:22:53,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:53,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:53,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:53,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:53,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:53,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:53" (1/1) ... [2019-10-15 01:22:53,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f837a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:53, skipping insertion in model container [2019-10-15 01:22:53,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:53" (1/1) ... [2019-10-15 01:22:53,398 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:53,555 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:54,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:54,538 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:55,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:55,079 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:55,080 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,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:55,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:55,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:55,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:55,103 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,104 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,144 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,145 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,216 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,249 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,264 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,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:55,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:55,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:55,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:55,286 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,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:55,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:55,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:22:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:22:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:22:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:22:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:22:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:22:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:22:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:22:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:22:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:22:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:22:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:22:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:58,907 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:58,907 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:22:58,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:58 BoogieIcfgContainer [2019-10-15 01:22:58,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:58,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:58,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:58,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:58,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:53" (1/3) ... [2019-10-15 01:22:58,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ca60cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:58, skipping insertion in model container [2019-10-15 01:22:58,921 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:58,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ca60cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:58, skipping insertion in model container [2019-10-15 01:22:58,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:58" (3/3) ... [2019-10-15 01:22:58,924 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:22:58,937 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:58,948 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 01:22:58,961 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 01:22:59,006 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:59,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:59,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:59,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:59,007 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:59,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:59,007 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:59,007 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-15 01:22:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:22:59,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:59,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] [2019-10-15 01:22:59,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-15 01:22:59,108 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:59,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879554338] [2019-10-15 01:22:59,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:59,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:59,677 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,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879554338] [2019-10-15 01:22:59,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:59,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:22:59,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771699232] [2019-10-15 01:22:59,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:22:59,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:59,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:22:59,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:59,705 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-15 01:23:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:02,030 INFO L93 Difference]: Finished difference Result 2483 states and 4339 transitions. [2019-10-15 01:23:02,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:02,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-15 01:23:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:02,064 INFO L225 Difference]: With dead ends: 2483 [2019-10-15 01:23:02,064 INFO L226 Difference]: Without dead ends: 1562 [2019-10-15 01:23:02,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-10-15 01:23:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1556. [2019-10-15 01:23:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-10-15 01:23:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2098 transitions. [2019-10-15 01:23:02,239 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2098 transitions. Word has length 55 [2019-10-15 01:23:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:02,240 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 2098 transitions. [2019-10-15 01:23:02,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2098 transitions. [2019-10-15 01:23:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:02,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:02,245 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:02,246 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-15 01:23:02,246 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:02,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387316841] [2019-10-15 01:23:02,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:02,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:02,497 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,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387316841] [2019-10-15 01:23:02,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:02,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:02,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398728380] [2019-10-15 01:23:02,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:02,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:02,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:02,502 INFO L87 Difference]: Start difference. First operand 1556 states and 2098 transitions. Second operand 6 states. [2019-10-15 01:23:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:03,834 INFO L93 Difference]: Finished difference Result 3394 states and 4672 transitions. [2019-10-15 01:23:03,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:03,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 01:23:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:03,846 INFO L225 Difference]: With dead ends: 3394 [2019-10-15 01:23:03,847 INFO L226 Difference]: Without dead ends: 2302 [2019-10-15 01:23:03,850 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:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-10-15 01:23:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2286. [2019-10-15 01:23:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-10-15 01:23:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3132 transitions. [2019-10-15 01:23:03,942 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3132 transitions. Word has length 56 [2019-10-15 01:23:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:03,942 INFO L462 AbstractCegarLoop]: Abstraction has 2286 states and 3132 transitions. [2019-10-15 01:23:03,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3132 transitions. [2019-10-15 01:23:03,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:03,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:03,947 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:03,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:03,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-15 01:23:03,948 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:03,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275301860] [2019-10-15 01:23:03,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:03,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:04,062 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:04,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275301860] [2019-10-15 01:23:04,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:04,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:04,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913949289] [2019-10-15 01:23:04,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:04,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:04,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:04,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:04,065 INFO L87 Difference]: Start difference. First operand 2286 states and 3132 transitions. Second operand 6 states. [2019-10-15 01:23:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:05,603 INFO L93 Difference]: Finished difference Result 5902 states and 8156 transitions. [2019-10-15 01:23:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:05,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-15 01:23:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:05,632 INFO L225 Difference]: With dead ends: 5902 [2019-10-15 01:23:05,633 INFO L226 Difference]: Without dead ends: 4341 [2019-10-15 01:23:05,639 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:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-10-15 01:23:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4321. [2019-10-15 01:23:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-15 01:23:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5977 transitions. [2019-10-15 01:23:05,925 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5977 transitions. Word has length 56 [2019-10-15 01:23:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:05,926 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5977 transitions. [2019-10-15 01:23:05,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5977 transitions. [2019-10-15 01:23:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:05,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:05,932 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:05,933 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-15 01:23:05,934 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:05,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593943022] [2019-10-15 01:23:05,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:05,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:06,163 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,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593943022] [2019-10-15 01:23:06,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:06,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:06,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732249913] [2019-10-15 01:23:06,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:06,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:06,167 INFO L87 Difference]: Start difference. First operand 4321 states and 5977 transitions. Second operand 9 states. [2019-10-15 01:23:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:10,064 INFO L93 Difference]: Finished difference Result 8366 states and 12155 transitions. [2019-10-15 01:23:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:23:10,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-15 01:23:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:10,110 INFO L225 Difference]: With dead ends: 8366 [2019-10-15 01:23:10,110 INFO L226 Difference]: Without dead ends: 8361 [2019-10-15 01:23:10,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:23:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2019-10-15 01:23:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 4321. [2019-10-15 01:23:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-15 01:23:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5976 transitions. [2019-10-15 01:23:10,462 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5976 transitions. Word has length 57 [2019-10-15 01:23:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:10,463 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5976 transitions. [2019-10-15 01:23:10,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5976 transitions. [2019-10-15 01:23:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:10,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:10,471 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:10,472 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:10,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-15 01:23:10,473 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:10,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338576441] [2019-10-15 01:23:10,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:10,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:10,749 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,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338576441] [2019-10-15 01:23:10,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:10,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:10,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948604943] [2019-10-15 01:23:10,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:10,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:10,753 INFO L87 Difference]: Start difference. First operand 4321 states and 5976 transitions. Second operand 9 states. [2019-10-15 01:23:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:14,754 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-10-15 01:23:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:14,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-15 01:23:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:14,806 INFO L225 Difference]: With dead ends: 12184 [2019-10-15 01:23:14,806 INFO L226 Difference]: Without dead ends: 11066 [2019-10-15 01:23:14,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:23:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-15 01:23:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4321. [2019-10-15 01:23:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-15 01:23:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5975 transitions. [2019-10-15 01:23:15,181 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5975 transitions. Word has length 57 [2019-10-15 01:23:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:15,181 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5975 transitions. [2019-10-15 01:23:15,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5975 transitions. [2019-10-15 01:23:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:15,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:15,186 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:15,187 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-15 01:23:15,187 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:15,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447903817] [2019-10-15 01:23:15,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:15,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:15,395 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:15,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447903817] [2019-10-15 01:23:15,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:15,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:15,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009893816] [2019-10-15 01:23:15,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:15,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:15,399 INFO L87 Difference]: Start difference. First operand 4321 states and 5975 transitions. Second operand 8 states. [2019-10-15 01:23:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:18,415 INFO L93 Difference]: Finished difference Result 9393 states and 13829 transitions. [2019-10-15 01:23:18,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:23:18,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-15 01:23:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:18,433 INFO L225 Difference]: With dead ends: 9393 [2019-10-15 01:23:18,433 INFO L226 Difference]: Without dead ends: 8067 [2019-10-15 01:23:18,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:23:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-15 01:23:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 4321. [2019-10-15 01:23:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-15 01:23:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5974 transitions. [2019-10-15 01:23:18,704 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5974 transitions. Word has length 57 [2019-10-15 01:23:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,704 INFO L462 AbstractCegarLoop]: Abstraction has 4321 states and 5974 transitions. [2019-10-15 01:23:18,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:23:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5974 transitions. [2019-10-15 01:23:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:18,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,710 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] [2019-10-15 01:23:18,711 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-15 01:23:18,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913764857] [2019-10-15 01:23:18,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,798 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,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913764857] [2019-10-15 01:23:18,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:18,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223423213] [2019-10-15 01:23:18,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:18,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:18,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:18,800 INFO L87 Difference]: Start difference. First operand 4321 states and 5974 transitions. Second operand 3 states. [2019-10-15 01:23:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:19,217 INFO L93 Difference]: Finished difference Result 8351 states and 11768 transitions. [2019-10-15 01:23:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:19,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:19,230 INFO L225 Difference]: With dead ends: 8351 [2019-10-15 01:23:19,231 INFO L226 Difference]: Without dead ends: 5831 [2019-10-15 01:23:19,238 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:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2019-10-15 01:23:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 5825. [2019-10-15 01:23:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-10-15 01:23:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7963 transitions. [2019-10-15 01:23:19,595 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7963 transitions. Word has length 58 [2019-10-15 01:23:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:19,596 INFO L462 AbstractCegarLoop]: Abstraction has 5825 states and 7963 transitions. [2019-10-15 01:23:19,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7963 transitions. [2019-10-15 01:23:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:19,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:19,603 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] [2019-10-15 01:23:19,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-15 01:23:19,604 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:19,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764793892] [2019-10-15 01:23:19,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:19,681 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:19,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764793892] [2019-10-15 01:23:19,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:19,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:19,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680370637] [2019-10-15 01:23:19,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:19,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:19,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:19,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:19,683 INFO L87 Difference]: Start difference. First operand 5825 states and 7963 transitions. Second operand 3 states. [2019-10-15 01:23:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:20,183 INFO L93 Difference]: Finished difference Result 9254 states and 13261 transitions. [2019-10-15 01:23:20,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:20,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:20,200 INFO L225 Difference]: With dead ends: 9254 [2019-10-15 01:23:20,200 INFO L226 Difference]: Without dead ends: 6946 [2019-10-15 01:23:20,207 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:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-10-15 01:23:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6354. [2019-10-15 01:23:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-10-15 01:23:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 8829 transitions. [2019-10-15 01:23:20,636 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 8829 transitions. Word has length 58 [2019-10-15 01:23:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:20,637 INFO L462 AbstractCegarLoop]: Abstraction has 6354 states and 8829 transitions. [2019-10-15 01:23:20,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 8829 transitions. [2019-10-15 01:23:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:20,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:20,642 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] [2019-10-15 01:23:20,642 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-15 01:23:20,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:20,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068375035] [2019-10-15 01:23:20,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:20,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:20,706 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,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068375035] [2019-10-15 01:23:20,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:20,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:20,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918042368] [2019-10-15 01:23:20,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:20,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:20,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:20,708 INFO L87 Difference]: Start difference. First operand 6354 states and 8829 transitions. Second operand 3 states. [2019-10-15 01:23:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:21,446 INFO L93 Difference]: Finished difference Result 11578 states and 16758 transitions. [2019-10-15 01:23:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:21,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:21,464 INFO L225 Difference]: With dead ends: 11578 [2019-10-15 01:23:21,465 INFO L226 Difference]: Without dead ends: 8287 [2019-10-15 01:23:21,472 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:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-10-15 01:23:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7385. [2019-10-15 01:23:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7385 states. [2019-10-15 01:23:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 10353 transitions. [2019-10-15 01:23:22,118 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 10353 transitions. Word has length 58 [2019-10-15 01:23:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:22,118 INFO L462 AbstractCegarLoop]: Abstraction has 7385 states and 10353 transitions. [2019-10-15 01:23:22,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 10353 transitions. [2019-10-15 01:23:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:22,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,124 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] [2019-10-15 01:23:22,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-15 01:23:22,125 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599514059] [2019-10-15 01:23:22,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:22,194 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:22,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599514059] [2019-10-15 01:23:22,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:22,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:22,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829822083] [2019-10-15 01:23:22,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:22,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:22,198 INFO L87 Difference]: Start difference. First operand 7385 states and 10353 transitions. Second operand 3 states. [2019-10-15 01:23:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:23,423 INFO L93 Difference]: Finished difference Result 14377 states and 20411 transitions. [2019-10-15 01:23:23,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:23,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 01:23:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:23,442 INFO L225 Difference]: With dead ends: 14377 [2019-10-15 01:23:23,442 INFO L226 Difference]: Without dead ends: 7581 [2019-10-15 01:23:23,456 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:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states.