/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:28,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:28,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:28,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:28,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:28,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:28,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:28,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:28,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:28,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:28,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:28,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:28,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:28,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:28,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:28,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:28,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:28,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:28,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:28,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:28,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:28,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:28,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:28,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:28,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:28,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:28,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:28,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:28,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:28,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:28,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:28,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:28,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:28,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:28,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:28,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:28,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:28,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:28,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:28,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:28,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:28,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 01:05:28,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:28,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:28,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:28,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:28,164 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:28,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:28,165 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:28,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:28,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:28,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:28,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:28,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:28,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:28,166 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:28,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:28,167 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:28,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:28,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:28,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:28,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:28,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:28,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:28,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:28,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:28,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:28,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:28,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:28,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:28,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:05:28,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:28,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:28,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:28,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:28,480 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:28,481 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+nlh-reducer.c [2019-11-07 01:05:28,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943e785ef/6d209584c6dd4e50a61d6356a55df233/FLAGfdf6ab6a3 [2019-11-07 01:05:29,019 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:29,020 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+nlh-reducer.c [2019-11-07 01:05:29,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943e785ef/6d209584c6dd4e50a61d6356a55df233/FLAGfdf6ab6a3 [2019-11-07 01:05:29,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943e785ef/6d209584c6dd4e50a61d6356a55df233 [2019-11-07 01:05:29,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:29,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:29,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:29,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:29,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:29,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:29" (1/1) ... [2019-11-07 01:05:29,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789b381a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:29, skipping insertion in model container [2019-11-07 01:05:29,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:29" (1/1) ... [2019-11-07 01:05:29,433 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:29,518 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:29,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:30,029 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:30,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:30,158 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:30,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30 WrapperNode [2019-11-07 01:05:30,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:30,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:30,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:30,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:30,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... [2019-11-07 01:05:30,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:30,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:30,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:30,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:30,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:30,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:30,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:30,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:31,190 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:31,190 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:31,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:31 BoogieIcfgContainer [2019-11-07 01:05:31,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:31,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:31,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:31,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:31,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:29" (1/3) ... [2019-11-07 01:05:31,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee7d302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:31, skipping insertion in model container [2019-11-07 01:05:31,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:30" (2/3) ... [2019-11-07 01:05:31,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee7d302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:31, skipping insertion in model container [2019-11-07 01:05:31,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:31" (3/3) ... [2019-11-07 01:05:31,200 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:05:31,210 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:31,219 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:05:31,231 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:05:31,259 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:31,259 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:31,259 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:31,259 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:31,260 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:31,260 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:31,260 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:31,260 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-11-07 01:05:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 01:05:31,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:31,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:31,296 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash 273290580, now seen corresponding path program 1 times [2019-11-07 01:05:31,313 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:31,313 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733607866] [2019-11-07 01:05:31,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:31,813 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733607866] [2019-11-07 01:05:31,814 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:31,814 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:31,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068566522] [2019-11-07 01:05:31,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:31,826 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:31,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:31,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:31,845 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 6 states. [2019-11-07 01:05:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:32,317 INFO L93 Difference]: Finished difference Result 731 states and 1151 transitions. [2019-11-07 01:05:32,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 01:05:32,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-07 01:05:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:32,349 INFO L225 Difference]: With dead ends: 731 [2019-11-07 01:05:32,350 INFO L226 Difference]: Without dead ends: 632 [2019-11-07 01:05:32,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-07 01:05:32,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-07 01:05:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 425. [2019-11-07 01:05:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-07 01:05:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 641 transitions. [2019-11-07 01:05:32,477 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 641 transitions. Word has length 53 [2019-11-07 01:05:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:32,478 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 641 transitions. [2019-11-07 01:05:32,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 641 transitions. [2019-11-07 01:05:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:32,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:32,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:32,482 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1842914518, now seen corresponding path program 1 times [2019-11-07 01:05:32,482 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:32,483 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449506447] [2019-11-07 01:05:32,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:32,609 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449506447] [2019-11-07 01:05:32,609 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:32,610 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:32,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897459662] [2019-11-07 01:05:32,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:32,612 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:32,613 INFO L87 Difference]: Start difference. First operand 425 states and 641 transitions. Second operand 3 states. [2019-11-07 01:05:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:32,689 INFO L93 Difference]: Finished difference Result 1108 states and 1693 transitions. [2019-11-07 01:05:32,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:32,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-07 01:05:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:32,694 INFO L225 Difference]: With dead ends: 1108 [2019-11-07 01:05:32,695 INFO L226 Difference]: Without dead ends: 751 [2019-11-07 01:05:32,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-11-07 01:05:32,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 749. [2019-11-07 01:05:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-11-07 01:05:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1125 transitions. [2019-11-07 01:05:32,765 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1125 transitions. Word has length 56 [2019-11-07 01:05:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:32,766 INFO L462 AbstractCegarLoop]: Abstraction has 749 states and 1125 transitions. [2019-11-07 01:05:32,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1125 transitions. [2019-11-07 01:05:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 01:05:32,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:32,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:32,777 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:32,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash -315457832, now seen corresponding path program 1 times [2019-11-07 01:05:32,778 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:32,778 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701197697] [2019-11-07 01:05:32,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:32,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701197697] [2019-11-07 01:05:32,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:32,924 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:32,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772940146] [2019-11-07 01:05:32,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:32,926 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:32,926 INFO L87 Difference]: Start difference. First operand 749 states and 1125 transitions. Second operand 3 states. [2019-11-07 01:05:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:33,038 INFO L93 Difference]: Finished difference Result 2012 states and 3038 transitions. [2019-11-07 01:05:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:33,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-07 01:05:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:33,047 INFO L225 Difference]: With dead ends: 2012 [2019-11-07 01:05:33,048 INFO L226 Difference]: Without dead ends: 1339 [2019-11-07 01:05:33,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-11-07 01:05:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-11-07 01:05:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-11-07 01:05:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1974 transitions. [2019-11-07 01:05:33,150 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1974 transitions. Word has length 56 [2019-11-07 01:05:33,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:33,150 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1974 transitions. [2019-11-07 01:05:33,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1974 transitions. [2019-11-07 01:05:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 01:05:33,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:33,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:33,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:33,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:33,153 INFO L82 PathProgramCache]: Analyzing trace with hash -622080838, now seen corresponding path program 1 times [2019-11-07 01:05:33,153 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:33,154 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253232736] [2019-11-07 01:05:33,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:33,350 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253232736] [2019-11-07 01:05:33,350 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:33,350 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:05:33,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98581931] [2019-11-07 01:05:33,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:05:33,351 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:05:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:05:33,352 INFO L87 Difference]: Start difference. First operand 1337 states and 1974 transitions. Second operand 10 states. [2019-11-07 01:05:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:35,332 INFO L93 Difference]: Finished difference Result 7876 states and 11683 transitions. [2019-11-07 01:05:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 01:05:35,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-07 01:05:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:35,372 INFO L225 Difference]: With dead ends: 7876 [2019-11-07 01:05:35,373 INFO L226 Difference]: Without dead ends: 7375 [2019-11-07 01:05:35,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-11-07 01:05:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2019-11-07 01:05:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 1362. [2019-11-07 01:05:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-11-07 01:05:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2006 transitions. [2019-11-07 01:05:35,566 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2006 transitions. Word has length 57 [2019-11-07 01:05:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:35,566 INFO L462 AbstractCegarLoop]: Abstraction has 1362 states and 2006 transitions. [2019-11-07 01:05:35,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:05:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2006 transitions. [2019-11-07 01:05:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:35,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:35,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:35,570 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash -993204644, now seen corresponding path program 1 times [2019-11-07 01:05:35,571 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:35,571 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651645862] [2019-11-07 01:05:35,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:35,712 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651645862] [2019-11-07 01:05:35,712 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:35,712 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:35,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669952886] [2019-11-07 01:05:35,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:35,713 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:35,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:35,714 INFO L87 Difference]: Start difference. First operand 1362 states and 2006 transitions. Second operand 9 states. [2019-11-07 01:05:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:37,877 INFO L93 Difference]: Finished difference Result 8646 states and 12825 transitions. [2019-11-07 01:05:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 01:05:37,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-11-07 01:05:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:37,955 INFO L225 Difference]: With dead ends: 8646 [2019-11-07 01:05:37,955 INFO L226 Difference]: Without dead ends: 7508 [2019-11-07 01:05:37,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-11-07 01:05:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2019-11-07 01:05:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 1401. [2019-11-07 01:05:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-11-07 01:05:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2057 transitions. [2019-11-07 01:05:38,146 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2057 transitions. Word has length 58 [2019-11-07 01:05:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:38,146 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 2057 transitions. [2019-11-07 01:05:38,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2057 transitions. [2019-11-07 01:05:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 01:05:38,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:38,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:38,148 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1499714113, now seen corresponding path program 1 times [2019-11-07 01:05:38,149 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:38,149 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986493638] [2019-11-07 01:05:38,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:38,241 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986493638] [2019-11-07 01:05:38,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:38,242 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:05:38,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866953938] [2019-11-07 01:05:38,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:05:38,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:05:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:05:38,244 INFO L87 Difference]: Start difference. First operand 1401 states and 2057 transitions. Second operand 7 states. [2019-11-07 01:05:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:39,312 INFO L93 Difference]: Finished difference Result 5866 states and 8795 transitions. [2019-11-07 01:05:39,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:05:39,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-11-07 01:05:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:39,339 INFO L225 Difference]: With dead ends: 5866 [2019-11-07 01:05:39,339 INFO L226 Difference]: Without dead ends: 5365 [2019-11-07 01:05:39,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-07 01:05:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2019-11-07 01:05:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 1382. [2019-11-07 01:05:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-11-07 01:05:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2033 transitions. [2019-11-07 01:05:39,537 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2033 transitions. Word has length 58 [2019-11-07 01:05:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:39,539 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 2033 transitions. [2019-11-07 01:05:39,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:05:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2033 transitions. [2019-11-07 01:05:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:39,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:39,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:39,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:39,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1924616750, now seen corresponding path program 1 times [2019-11-07 01:05:39,547 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:39,556 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467696859] [2019-11-07 01:05:39,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:39,696 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467696859] [2019-11-07 01:05:39,696 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:39,696 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:05:39,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377437641] [2019-11-07 01:05:39,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:05:39,697 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:05:39,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:05:39,699 INFO L87 Difference]: Start difference. First operand 1382 states and 2033 transitions. Second operand 7 states. [2019-11-07 01:05:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:40,663 INFO L93 Difference]: Finished difference Result 5664 states and 8377 transitions. [2019-11-07 01:05:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:05:40,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-11-07 01:05:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:40,684 INFO L225 Difference]: With dead ends: 5664 [2019-11-07 01:05:40,685 INFO L226 Difference]: Without dead ends: 4526 [2019-11-07 01:05:40,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-07 01:05:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2019-11-07 01:05:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 1363. [2019-11-07 01:05:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-11-07 01:05:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2006 transitions. [2019-11-07 01:05:40,880 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2006 transitions. Word has length 59 [2019-11-07 01:05:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:40,881 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2006 transitions. [2019-11-07 01:05:40,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:05:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2006 transitions. [2019-11-07 01:05:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:40,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:40,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:40,883 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash -157395530, now seen corresponding path program 1 times [2019-11-07 01:05:40,884 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:40,884 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654966343] [2019-11-07 01:05:40,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:41,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654966343] [2019-11-07 01:05:41,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:41,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:41,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215192643] [2019-11-07 01:05:41,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:41,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:41,019 INFO L87 Difference]: Start difference. First operand 1363 states and 2006 transitions. Second operand 9 states. [2019-11-07 01:05:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:42,346 INFO L93 Difference]: Finished difference Result 7072 states and 10472 transitions. [2019-11-07 01:05:42,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:05:42,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-11-07 01:05:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:42,363 INFO L225 Difference]: With dead ends: 7072 [2019-11-07 01:05:42,363 INFO L226 Difference]: Without dead ends: 5799 [2019-11-07 01:05:42,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:05:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5799 states. [2019-11-07 01:05:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5799 to 3842. [2019-11-07 01:05:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2019-11-07 01:05:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 5718 transitions. [2019-11-07 01:05:42,856 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 5718 transitions. Word has length 59 [2019-11-07 01:05:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:42,857 INFO L462 AbstractCegarLoop]: Abstraction has 3842 states and 5718 transitions. [2019-11-07 01:05:42,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 5718 transitions. [2019-11-07 01:05:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:05:42,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:42,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:42,860 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2127126793, now seen corresponding path program 1 times [2019-11-07 01:05:42,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:42,860 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416279403] [2019-11-07 01:05:42,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:42,980 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416279403] [2019-11-07 01:05:42,982 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:42,982 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:42,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018467202] [2019-11-07 01:05:42,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:42,983 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:42,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:42,984 INFO L87 Difference]: Start difference. First operand 3842 states and 5718 transitions. Second operand 9 states. [2019-11-07 01:05:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:45,408 INFO L93 Difference]: Finished difference Result 20312 states and 30202 transitions. [2019-11-07 01:05:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:05:45,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-11-07 01:05:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:45,446 INFO L225 Difference]: With dead ends: 20312 [2019-11-07 01:05:45,446 INFO L226 Difference]: Without dead ends: 16960 [2019-11-07 01:05:45,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:05:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16960 states. [2019-11-07 01:05:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16960 to 11727. [2019-11-07 01:05:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-11-07 01:05:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 17416 transitions. [2019-11-07 01:05:47,560 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 17416 transitions. Word has length 59 [2019-11-07 01:05:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:47,560 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 17416 transitions. [2019-11-07 01:05:47,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:05:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 17416 transitions. [2019-11-07 01:05:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:05:47,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:47,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:47,565 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1033600256, now seen corresponding path program 1 times [2019-11-07 01:05:47,565 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:47,565 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634641234] [2019-11-07 01:05:47,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:47,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634641234] [2019-11-07 01:05:47,642 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:47,642 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:47,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779836347] [2019-11-07 01:05:47,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:47,646 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:47,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:47,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:47,646 INFO L87 Difference]: Start difference. First operand 11727 states and 17416 transitions. Second operand 6 states. [2019-11-07 01:05:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:49,461 INFO L93 Difference]: Finished difference Result 23775 states and 35310 transitions. [2019-11-07 01:05:49,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:49,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-07 01:05:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:49,488 INFO L225 Difference]: With dead ends: 23775 [2019-11-07 01:05:49,488 INFO L226 Difference]: Without dead ends: 12940 [2019-11-07 01:05:49,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2019-11-07 01:05:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 8396. [2019-11-07 01:05:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8396 states. [2019-11-07 01:05:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8396 states to 8396 states and 12355 transitions. [2019-11-07 01:05:50,393 INFO L78 Accepts]: Start accepts. Automaton has 8396 states and 12355 transitions. Word has length 60 [2019-11-07 01:05:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:50,393 INFO L462 AbstractCegarLoop]: Abstraction has 8396 states and 12355 transitions. [2019-11-07 01:05:50,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8396 states and 12355 transitions. [2019-11-07 01:05:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:05:50,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:50,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:50,397 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -976844717, now seen corresponding path program 1 times [2019-11-07 01:05:50,397 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:50,397 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559390221] [2019-11-07 01:05:50,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:50,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559390221] [2019-11-07 01:05:50,476 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:50,477 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:05:50,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144904999] [2019-11-07 01:05:50,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:05:50,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:05:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:05:50,478 INFO L87 Difference]: Start difference. First operand 8396 states and 12355 transitions. Second operand 6 states. [2019-11-07 01:05:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:52,051 INFO L93 Difference]: Finished difference Result 20131 states and 29816 transitions. [2019-11-07 01:05:52,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:52,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-07 01:05:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:52,074 INFO L225 Difference]: With dead ends: 20131 [2019-11-07 01:05:52,074 INFO L226 Difference]: Without dead ends: 12331 [2019-11-07 01:05:52,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:05:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12331 states. [2019-11-07 01:05:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12331 to 7655. [2019-11-07 01:05:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-11-07 01:05:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11188 transitions. [2019-11-07 01:05:52,968 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11188 transitions. Word has length 60 [2019-11-07 01:05:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:52,969 INFO L462 AbstractCegarLoop]: Abstraction has 7655 states and 11188 transitions. [2019-11-07 01:05:52,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:05:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11188 transitions. [2019-11-07 01:05:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:05:52,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:52,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:52,971 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:52,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1274910523, now seen corresponding path program 1 times [2019-11-07 01:05:52,972 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:52,972 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041638896] [2019-11-07 01:05:52,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:53,032 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041638896] [2019-11-07 01:05:53,032 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:53,032 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:53,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293472299] [2019-11-07 01:05:53,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:53,033 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:53,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:53,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:53,034 INFO L87 Difference]: Start difference. First operand 7655 states and 11188 transitions. Second operand 5 states. [2019-11-07 01:05:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:54,567 INFO L93 Difference]: Finished difference Result 18506 states and 26953 transitions. [2019-11-07 01:05:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:54,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-07 01:05:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:54,581 INFO L225 Difference]: With dead ends: 18506 [2019-11-07 01:05:54,582 INFO L226 Difference]: Without dead ends: 10932 [2019-11-07 01:05:54,598 INFO L630 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-11-07 01:05:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2019-11-07 01:05:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 7655. [2019-11-07 01:05:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2019-11-07 01:05:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 11084 transitions. [2019-11-07 01:05:55,634 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 11084 transitions. Word has length 60 [2019-11-07 01:05:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:55,634 INFO L462 AbstractCegarLoop]: Abstraction has 7655 states and 11084 transitions. [2019-11-07 01:05:55,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 11084 transitions. [2019-11-07 01:05:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-07 01:05:55,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:55,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:55,637 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1286220475, now seen corresponding path program 1 times [2019-11-07 01:05:55,637 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:55,638 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610831259] [2019-11-07 01:05:55,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:55,704 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610831259] [2019-11-07 01:05:55,704 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:55,704 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:55,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169624404] [2019-11-07 01:05:55,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:55,705 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:55,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:55,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:55,705 INFO L87 Difference]: Start difference. First operand 7655 states and 11084 transitions. Second operand 5 states. [2019-11-07 01:05:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:57,571 INFO L93 Difference]: Finished difference Result 19872 states and 28987 transitions. [2019-11-07 01:05:57,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:05:57,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-07 01:05:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:57,590 INFO L225 Difference]: With dead ends: 19872 [2019-11-07 01:05:57,590 INFO L226 Difference]: Without dead ends: 15928 [2019-11-07 01:05:57,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:05:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15928 states. [2019-11-07 01:05:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15928 to 9395. [2019-11-07 01:05:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9395 states. [2019-11-07 01:05:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9395 states to 9395 states and 13659 transitions. [2019-11-07 01:05:59,334 INFO L78 Accepts]: Start accepts. Automaton has 9395 states and 13659 transitions. Word has length 61 [2019-11-07 01:05:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:59,334 INFO L462 AbstractCegarLoop]: Abstraction has 9395 states and 13659 transitions. [2019-11-07 01:05:59,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:05:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9395 states and 13659 transitions. [2019-11-07 01:05:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-07 01:05:59,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:59,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:59,336 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash 740645981, now seen corresponding path program 1 times [2019-11-07 01:05:59,336 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:59,337 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989896997] [2019-11-07 01:05:59,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:59,402 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989896997] [2019-11-07 01:05:59,402 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:59,402 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:05:59,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023969330] [2019-11-07 01:05:59,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:05:59,403 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:05:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:05:59,404 INFO L87 Difference]: Start difference. First operand 9395 states and 13659 transitions. Second operand 5 states. [2019-11-07 01:06:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:01,637 INFO L93 Difference]: Finished difference Result 21359 states and 31168 transitions. [2019-11-07 01:06:01,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:01,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-07 01:06:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:01,652 INFO L225 Difference]: With dead ends: 21359 [2019-11-07 01:06:01,653 INFO L226 Difference]: Without dead ends: 17415 [2019-11-07 01:06:01,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:06:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2019-11-07 01:06:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 11338. [2019-11-07 01:06:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-11-07 01:06:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 16529 transitions. [2019-11-07 01:06:03,112 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 16529 transitions. Word has length 61 [2019-11-07 01:06:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:03,112 INFO L462 AbstractCegarLoop]: Abstraction has 11338 states and 16529 transitions. [2019-11-07 01:06:03,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 16529 transitions. [2019-11-07 01:06:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-07 01:06:03,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:03,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:03,115 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:03,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1147863087, now seen corresponding path program 1 times [2019-11-07 01:06:03,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:03,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566289762] [2019-11-07 01:06:03,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:03,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566289762] [2019-11-07 01:06:03,156 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:03,157 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:03,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417552734] [2019-11-07 01:06:03,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:03,157 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:03,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:03,158 INFO L87 Difference]: Start difference. First operand 11338 states and 16529 transitions. Second operand 3 states.