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 -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:36:44,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:36:44,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:36:44,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:36:44,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:36:44,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:36:44,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:36:44,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:36:44,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:36:44,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:36:44,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:36:44,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:36:44,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:36:44,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:36:44,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:36:44,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:36:44,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:36:44,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:36:44,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:36:44,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:36:44,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:36:44,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:36:44,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:36:44,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:36:44,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:36:44,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:36:44,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:36:44,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:36:44,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:36:44,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:36:44,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:36:44,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:36:44,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:36:44,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:36:44,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:36:44,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:36:44,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:36:44,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:36:44,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:36:44,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:36:44,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:36:44,294 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-09-08 10:36:44,308 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:36:44,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:36:44,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:36:44,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:36:44,310 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:36:44,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:36:44,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:36:44,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:36:44,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:36:44,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:36:44,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:36:44,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:36:44,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:36:44,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:36:44,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:36:44,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:36:44,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:36:44,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:36:44,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:36:44,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:36:44,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:36:44,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:36:44,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:36:44,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:36:44,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:36:44,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:36:44,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:36:44,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:36:44,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:36:44,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:36:44,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:36:44,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:36:44,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:36:44,360 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:36:44,361 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:36:44,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8944bccb/6b7e4011e5c9479bb9f360de53d2fea2/FLAG9f3a59324 [2019-09-08 10:36:45,124 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:36:45,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:36:45,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8944bccb/6b7e4011e5c9479bb9f360de53d2fea2/FLAG9f3a59324 [2019-09-08 10:36:45,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8944bccb/6b7e4011e5c9479bb9f360de53d2fea2 [2019-09-08 10:36:45,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:36:45,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:36:45,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:36:45,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:36:45,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:36:45,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:36:45" (1/1) ... [2019-09-08 10:36:45,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0f14d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:45, skipping insertion in model container [2019-09-08 10:36:45,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:36:45" (1/1) ... [2019-09-08 10:36:45,253 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:36:45,389 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:36:46,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:36:46,562 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:36:46,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:36:46,932 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:36:46,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46 WrapperNode [2019-09-08 10:36:46,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:36:46,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:36:46,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:36:46,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:36:46,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:46,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:47,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:47,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:47,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (1/1) ... [2019-09-08 10:36:47,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:36:47,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:36:47,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:36:47,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:36:47,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (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-09-08 10:36:47,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:36:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:36:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:36:47,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:36:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:36:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:36:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:36:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:36:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:36:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:36:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:36:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:36:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:36:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:36:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:36:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:36:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:36:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:36:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:36:50,665 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:36:50,665 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:36:50,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:36:50 BoogieIcfgContainer [2019-09-08 10:36:50,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:36:50,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:36:50,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:36:50,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:36:50,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:36:45" (1/3) ... [2019-09-08 10:36:50,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209ee066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:36:50, skipping insertion in model container [2019-09-08 10:36:50,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:36:46" (2/3) ... [2019-09-08 10:36:50,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209ee066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:36:50, skipping insertion in model container [2019-09-08 10:36:50,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:36:50" (3/3) ... [2019-09-08 10:36:50,680 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:36:50,694 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:36:50,720 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-08 10:36:50,741 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-08 10:36:50,809 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:36:50,811 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:36:50,811 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:36:50,811 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:36:50,811 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:36:50,811 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:36:50,812 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:36:50,812 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:36:50,812 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:36:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-09-08 10:36:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:36:50,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:50,911 INFO L399 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-09-08 10:36:50,914 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-09-08 10:36:50,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:50,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:51,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:51,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:51,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:36:51,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:36:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:36:51,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:36:51,594 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-09-08 10:36:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:53,700 INFO L93 Difference]: Finished difference Result 2475 states and 4331 transitions. [2019-09-08 10:36:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:36:53,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 10:36:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:53,726 INFO L225 Difference]: With dead ends: 2475 [2019-09-08 10:36:53,727 INFO L226 Difference]: Without dead ends: 1554 [2019-09-08 10:36:53,736 INFO L628 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-09-08 10:36:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-09-08 10:36:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1548. [2019-09-08 10:36:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-09-08 10:36:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2090 transitions. [2019-09-08 10:36:53,902 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2090 transitions. Word has length 55 [2019-09-08 10:36:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:53,903 INFO L475 AbstractCegarLoop]: Abstraction has 1548 states and 2090 transitions. [2019-09-08 10:36:53,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:36:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2090 transitions. [2019-09-08 10:36:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:36:53,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:53,908 INFO L399 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-09-08 10:36:53,909 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-09-08 10:36:53,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:53,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:53,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:53,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:54,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:36:54,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:36:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:36:54,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:36:54,131 INFO L87 Difference]: Start difference. First operand 1548 states and 2090 transitions. Second operand 6 states. [2019-09-08 10:36:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:55,407 INFO L93 Difference]: Finished difference Result 3384 states and 4662 transitions. [2019-09-08 10:36:55,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:36:55,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:36:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:55,420 INFO L225 Difference]: With dead ends: 3384 [2019-09-08 10:36:55,421 INFO L226 Difference]: Without dead ends: 2296 [2019-09-08 10:36:55,424 INFO L628 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-09-08 10:36:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-09-08 10:36:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2280. [2019-09-08 10:36:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-09-08 10:36:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3126 transitions. [2019-09-08 10:36:55,518 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3126 transitions. Word has length 56 [2019-09-08 10:36:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:55,519 INFO L475 AbstractCegarLoop]: Abstraction has 2280 states and 3126 transitions. [2019-09-08 10:36:55,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:36:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3126 transitions. [2019-09-08 10:36:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:36:55,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:55,523 INFO L399 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-09-08 10:36:55,524 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:55,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:55,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-09-08 10:36:55,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:55,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:55,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:55,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:55,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:55,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:36:55,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:36:55,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:36:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:36:55,633 INFO L87 Difference]: Start difference. First operand 2280 states and 3126 transitions. Second operand 6 states. [2019-09-08 10:36:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:57,112 INFO L93 Difference]: Finished difference Result 5893 states and 8147 transitions. [2019-09-08 10:36:57,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:36:57,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:36:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:57,149 INFO L225 Difference]: With dead ends: 5893 [2019-09-08 10:36:57,150 INFO L226 Difference]: Without dead ends: 4335 [2019-09-08 10:36:57,157 INFO L628 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-09-08 10:36:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2019-09-08 10:36:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4315. [2019-09-08 10:36:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-08 10:36:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5971 transitions. [2019-09-08 10:36:57,467 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5971 transitions. Word has length 56 [2019-09-08 10:36:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:57,468 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5971 transitions. [2019-09-08 10:36:57,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:36:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5971 transitions. [2019-09-08 10:36:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:36:57,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:57,475 INFO L399 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-09-08 10:36:57,476 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-09-08 10:36:57,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:57,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:57,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:57,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:57,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:36:57,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:36:57,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:36:57,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:36:57,720 INFO L87 Difference]: Start difference. First operand 4315 states and 5971 transitions. Second operand 9 states. [2019-09-08 10:37:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:01,009 INFO L93 Difference]: Finished difference Result 9702 states and 14272 transitions. [2019-09-08 10:37:01,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:37:01,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-08 10:37:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:01,056 INFO L225 Difference]: With dead ends: 9702 [2019-09-08 10:37:01,056 INFO L226 Difference]: Without dead ends: 9697 [2019-09-08 10:37:01,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:37:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9697 states. [2019-09-08 10:37:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9697 to 4315. [2019-09-08 10:37:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-08 10:37:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5970 transitions. [2019-09-08 10:37:01,386 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5970 transitions. Word has length 57 [2019-09-08 10:37:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:01,387 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5970 transitions. [2019-09-08 10:37:01,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:37:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5970 transitions. [2019-09-08 10:37:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:37:01,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:01,393 INFO L399 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-09-08 10:37:01,393 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-09-08 10:37:01,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:01,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:01,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:01,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:01,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:01,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:01,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:37:01,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:37:01,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:37:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:37:01,617 INFO L87 Difference]: Start difference. First operand 4315 states and 5970 transitions. Second operand 9 states. [2019-09-08 10:37:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:06,477 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-09-08 10:37:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:37:06,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-09-08 10:37:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:06,534 INFO L225 Difference]: With dead ends: 12184 [2019-09-08 10:37:06,534 INFO L226 Difference]: Without dead ends: 11066 [2019-09-08 10:37:06,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:37:06,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-09-08 10:37:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4315. [2019-09-08 10:37:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-08 10:37:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5969 transitions. [2019-09-08 10:37:06,851 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5969 transitions. Word has length 57 [2019-09-08 10:37:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:06,852 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5969 transitions. [2019-09-08 10:37:06,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:37:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5969 transitions. [2019-09-08 10:37:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:37:06,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:06,856 INFO L399 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-09-08 10:37:06,857 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-09-08 10:37:06,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:06,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:07,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:37:07,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:37:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:37:07,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:37:07,027 INFO L87 Difference]: Start difference. First operand 4315 states and 5969 transitions. Second operand 8 states. [2019-09-08 10:37:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:10,023 INFO L93 Difference]: Finished difference Result 10742 states and 15963 transitions. [2019-09-08 10:37:10,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:37:10,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-08 10:37:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:10,045 INFO L225 Difference]: With dead ends: 10742 [2019-09-08 10:37:10,046 INFO L226 Difference]: Without dead ends: 9416 [2019-09-08 10:37:10,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:37:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-09-08 10:37:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 4315. [2019-09-08 10:37:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-08 10:37:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 5968 transitions. [2019-09-08 10:37:10,336 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 5968 transitions. Word has length 57 [2019-09-08 10:37:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:10,337 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 5968 transitions. [2019-09-08 10:37:10,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:37:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 5968 transitions. [2019-09-08 10:37:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:37:10,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:10,343 INFO L399 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-09-08 10:37:10,344 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:10,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-09-08 10:37:10,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:10,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:10,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:10,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:10,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:10,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:10,443 INFO L87 Difference]: Start difference. First operand 4315 states and 5968 transitions. Second operand 3 states. [2019-09-08 10:37:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:10,928 INFO L93 Difference]: Finished difference Result 7979 states and 11287 transitions. [2019-09-08 10:37:10,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:10,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-08 10:37:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:10,943 INFO L225 Difference]: With dead ends: 7979 [2019-09-08 10:37:10,943 INFO L226 Difference]: Without dead ends: 5459 [2019-09-08 10:37:10,950 INFO L628 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-09-08 10:37:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5459 states. [2019-09-08 10:37:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5459 to 5453. [2019-09-08 10:37:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-09-08 10:37:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 7525 transitions. [2019-09-08 10:37:11,362 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 7525 transitions. Word has length 58 [2019-09-08 10:37:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:11,364 INFO L475 AbstractCegarLoop]: Abstraction has 5453 states and 7525 transitions. [2019-09-08 10:37:11,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 7525 transitions. [2019-09-08 10:37:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:37:11,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:11,370 INFO L399 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-09-08 10:37:11,370 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-09-08 10:37:11,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:11,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:11,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:11,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:11,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:11,545 INFO L87 Difference]: Start difference. First operand 5453 states and 7525 transitions. Second operand 3 states. [2019-09-08 10:37:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:11,942 INFO L93 Difference]: Finished difference Result 8882 states and 12823 transitions. [2019-09-08 10:37:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:11,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-08 10:37:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:11,959 INFO L225 Difference]: With dead ends: 8882 [2019-09-08 10:37:11,959 INFO L226 Difference]: Without dead ends: 6617 [2019-09-08 10:37:11,968 INFO L628 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-09-08 10:37:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-09-08 10:37:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6025. [2019-09-08 10:37:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6025 states. [2019-09-08 10:37:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 8443 transitions. [2019-09-08 10:37:12,474 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 8443 transitions. Word has length 58 [2019-09-08 10:37:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:12,474 INFO L475 AbstractCegarLoop]: Abstraction has 6025 states and 8443 transitions. [2019-09-08 10:37:12,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 8443 transitions. [2019-09-08 10:37:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:37:12,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:12,480 INFO L399 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-09-08 10:37:12,480 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-09-08 10:37:12,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:12,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:12,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:12,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:12,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:12,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:12,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:12,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:12,561 INFO L87 Difference]: Start difference. First operand 6025 states and 8443 transitions. Second operand 3 states. [2019-09-08 10:37:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:13,166 INFO L93 Difference]: Finished difference Result 11249 states and 16372 transitions. [2019-09-08 10:37:13,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:13,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-08 10:37:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:13,183 INFO L225 Difference]: With dead ends: 11249 [2019-09-08 10:37:13,183 INFO L226 Difference]: Without dead ends: 8007 [2019-09-08 10:37:13,191 INFO L628 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-09-08 10:37:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8007 states. [2019-09-08 10:37:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8007 to 7105. [2019-09-08 10:37:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-09-08 10:37:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 10025 transitions. [2019-09-08 10:37:13,708 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 10025 transitions. Word has length 58 [2019-09-08 10:37:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:13,709 INFO L475 AbstractCegarLoop]: Abstraction has 7105 states and 10025 transitions. [2019-09-08 10:37:13,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 10025 transitions. [2019-09-08 10:37:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:37:13,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:13,713 INFO L399 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-09-08 10:37:13,714 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:13,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-09-08 10:37:13,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:13,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:13,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:13,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:13,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:13,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:13,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:13,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:13,769 INFO L87 Difference]: Start difference. First operand 7105 states and 10025 transitions. Second operand 3 states. [2019-09-08 10:37:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:14,977 INFO L93 Difference]: Finished difference Result 13710 states and 19567 transitions. [2019-09-08 10:37:14,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:14,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:37:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:14,993 INFO L225 Difference]: With dead ends: 13710 [2019-09-08 10:37:14,993 INFO L226 Difference]: Without dead ends: 7194 [2019-09-08 10:37:15,009 INFO L628 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-09-08 10:37:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2019-09-08 10:37:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 5653. [2019-09-08 10:37:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-09-08 10:37:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8055 transitions. [2019-09-08 10:37:15,644 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8055 transitions. Word has length 59 [2019-09-08 10:37:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:15,644 INFO L475 AbstractCegarLoop]: Abstraction has 5653 states and 8055 transitions. [2019-09-08 10:37:15,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8055 transitions. [2019-09-08 10:37:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:37:15,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:15,647 INFO L399 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-09-08 10:37:15,648 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:15,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-09-08 10:37:15,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:15,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:15,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:15,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:15,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-09-08 10:37:15,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:15,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:15,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:15,708 INFO L87 Difference]: Start difference. First operand 5653 states and 8055 transitions. Second operand 3 states. [2019-09-08 10:37:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:16,922 INFO L93 Difference]: Finished difference Result 13247 states and 19432 transitions. [2019-09-08 10:37:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:16,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:37:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:16,932 INFO L225 Difference]: With dead ends: 13247 [2019-09-08 10:37:16,932 INFO L226 Difference]: Without dead ends: 8449 [2019-09-08 10:37:16,943 INFO L628 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-09-08 10:37:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-08 10:37:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 6679. [2019-09-08 10:37:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2019-09-08 10:37:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 9719 transitions. [2019-09-08 10:37:17,645 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 9719 transitions. Word has length 59 [2019-09-08 10:37:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:17,646 INFO L475 AbstractCegarLoop]: Abstraction has 6679 states and 9719 transitions. [2019-09-08 10:37:17,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 9719 transitions. [2019-09-08 10:37:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:37:17,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:17,648 INFO L399 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-09-08 10:37:17,649 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:17,649 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-09-08 10:37:17,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:17,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:17,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:17,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:17,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:17,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:17,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:17,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:17,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:17,717 INFO L87 Difference]: Start difference. First operand 6679 states and 9719 transitions. Second operand 3 states. [2019-09-08 10:37:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:18,544 INFO L93 Difference]: Finished difference Result 16908 states and 25060 transitions. [2019-09-08 10:37:18,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:37:18,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:37:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:18,558 INFO L225 Difference]: With dead ends: 16908 [2019-09-08 10:37:18,558 INFO L226 Difference]: Without dead ends: 10816 [2019-09-08 10:37:18,571 INFO L628 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-09-08 10:37:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10816 states. [2019-09-08 10:37:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10816 to 8416. [2019-09-08 10:37:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-09-08 10:37:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 12405 transitions. [2019-09-08 10:37:19,444 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 12405 transitions. Word has length 59 [2019-09-08 10:37:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:19,444 INFO L475 AbstractCegarLoop]: Abstraction has 8416 states and 12405 transitions. [2019-09-08 10:37:19,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 12405 transitions. [2019-09-08 10:37:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:37:19,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:19,448 INFO L399 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-09-08 10:37:19,448 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1408819210, now seen corresponding path program 1 times [2019-09-08 10:37:19,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:19,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:19,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:19,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:19,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:19,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:19,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:37:19,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:37:19,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:37:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:37:19,976 INFO L87 Difference]: Start difference. First operand 8416 states and 12405 transitions. Second operand 13 states. [2019-09-08 10:37:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:23,325 INFO L93 Difference]: Finished difference Result 12683 states and 18692 transitions. [2019-09-08 10:37:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:37:23,326 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-09-08 10:37:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:23,340 INFO L225 Difference]: With dead ends: 12683 [2019-09-08 10:37:23,340 INFO L226 Difference]: Without dead ends: 12679 [2019-09-08 10:37:23,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:37:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2019-09-08 10:37:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 8412. [2019-09-08 10:37:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8412 states. [2019-09-08 10:37:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8412 states to 8412 states and 12401 transitions. [2019-09-08 10:37:24,755 INFO L78 Accepts]: Start accepts. Automaton has 8412 states and 12401 transitions. Word has length 60 [2019-09-08 10:37:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:24,755 INFO L475 AbstractCegarLoop]: Abstraction has 8412 states and 12401 transitions. [2019-09-08 10:37:24,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:37:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8412 states and 12401 transitions. [2019-09-08 10:37:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:37:24,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:24,757 INFO L399 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-09-08 10:37:24,757 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1965728590, now seen corresponding path program 1 times [2019-09-08 10:37:24,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:24,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:24,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:24,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:25,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-09-08 10:37:25,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:25,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:37:25,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:37:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:37:25,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:37:25,351 INFO L87 Difference]: Start difference. First operand 8412 states and 12401 transitions. Second operand 14 states. [2019-09-08 10:37:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:30,120 INFO L93 Difference]: Finished difference Result 18713 states and 27601 transitions. [2019-09-08 10:37:30,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:37:30,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-09-08 10:37:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:30,140 INFO L225 Difference]: With dead ends: 18713 [2019-09-08 10:37:30,140 INFO L226 Difference]: Without dead ends: 18466 [2019-09-08 10:37:30,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:37:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18466 states. [2019-09-08 10:37:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18466 to 8355. [2019-09-08 10:37:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8355 states. [2019-09-08 10:37:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8355 states to 8355 states and 12326 transitions. [2019-09-08 10:37:31,030 INFO L78 Accepts]: Start accepts. Automaton has 8355 states and 12326 transitions. Word has length 60 [2019-09-08 10:37:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:31,030 INFO L475 AbstractCegarLoop]: Abstraction has 8355 states and 12326 transitions. [2019-09-08 10:37:31,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:37:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8355 states and 12326 transitions. [2019-09-08 10:37:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:37:31,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:31,031 INFO L399 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-09-08 10:37:31,032 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1190610116, now seen corresponding path program 1 times [2019-09-08 10:37:31,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:31,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:31,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:31,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:31,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:37:31,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:37:31,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:37:31,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:37:31,435 INFO L87 Difference]: Start difference. First operand 8355 states and 12326 transitions. Second operand 11 states. [2019-09-08 10:37:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:34,718 INFO L93 Difference]: Finished difference Result 17926 states and 26605 transitions. [2019-09-08 10:37:34,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:37:34,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-09-08 10:37:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:34,738 INFO L225 Difference]: With dead ends: 17926 [2019-09-08 10:37:34,738 INFO L226 Difference]: Without dead ends: 17922 [2019-09-08 10:37:34,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:37:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17922 states. [2019-09-08 10:37:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17922 to 8351. [2019-09-08 10:37:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8351 states. [2019-09-08 10:37:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8351 states to 8351 states and 12322 transitions. [2019-09-08 10:37:35,784 INFO L78 Accepts]: Start accepts. Automaton has 8351 states and 12322 transitions. Word has length 61 [2019-09-08 10:37:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:35,785 INFO L475 AbstractCegarLoop]: Abstraction has 8351 states and 12322 transitions. [2019-09-08 10:37:35,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:37:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 8351 states and 12322 transitions. [2019-09-08 10:37:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:37:35,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:35,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:35,787 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:35,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash 624248826, now seen corresponding path program 1 times [2019-09-08 10:37:35,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:35,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:35,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:35,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:35,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:35,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:35,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:35,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:35,919 INFO L87 Difference]: Start difference. First operand 8351 states and 12322 transitions. Second operand 6 states. [2019-09-08 10:37:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:39,367 INFO L93 Difference]: Finished difference Result 36928 states and 54704 transitions. [2019-09-08 10:37:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:37:39,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-08 10:37:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:39,404 INFO L225 Difference]: With dead ends: 36928 [2019-09-08 10:37:39,404 INFO L226 Difference]: Without dead ends: 29296 [2019-09-08 10:37:39,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:37:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29296 states. [2019-09-08 10:37:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29296 to 25708. [2019-09-08 10:37:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25708 states. [2019-09-08 10:37:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25708 states to 25708 states and 37186 transitions. [2019-09-08 10:37:42,569 INFO L78 Accepts]: Start accepts. Automaton has 25708 states and 37186 transitions. Word has length 67 [2019-09-08 10:37:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:42,569 INFO L475 AbstractCegarLoop]: Abstraction has 25708 states and 37186 transitions. [2019-09-08 10:37:42,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 25708 states and 37186 transitions. [2019-09-08 10:37:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:37:42,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:42,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:42,572 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1849830759, now seen corresponding path program 1 times [2019-09-08 10:37:42,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:42,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:42,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:42,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:42,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-09-08 10:37:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:37:42,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:37:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:37:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:42,682 INFO L87 Difference]: Start difference. First operand 25708 states and 37186 transitions. Second operand 5 states. [2019-09-08 10:37:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:46,072 INFO L93 Difference]: Finished difference Result 47087 states and 68089 transitions. [2019-09-08 10:37:46,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:46,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:37:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:46,096 INFO L225 Difference]: With dead ends: 47087 [2019-09-08 10:37:46,096 INFO L226 Difference]: Without dead ends: 22073 [2019-09-08 10:37:46,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:37:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22073 states. [2019-09-08 10:37:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22073 to 19484. [2019-09-08 10:37:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19484 states. [2019-09-08 10:37:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19484 states to 19484 states and 27846 transitions. [2019-09-08 10:37:48,982 INFO L78 Accepts]: Start accepts. Automaton has 19484 states and 27846 transitions. Word has length 68 [2019-09-08 10:37:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:48,982 INFO L475 AbstractCegarLoop]: Abstraction has 19484 states and 27846 transitions. [2019-09-08 10:37:48,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:37:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19484 states and 27846 transitions. [2019-09-08 10:37:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:37:48,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:48,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:48,986 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1871092716, now seen corresponding path program 1 times [2019-09-08 10:37:48,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:48,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:48,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:49,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:49,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:37:49,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:37:49,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:37:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:37:49,085 INFO L87 Difference]: Start difference. First operand 19484 states and 27846 transitions. Second operand 6 states. [2019-09-08 10:37:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:54,593 INFO L93 Difference]: Finished difference Result 33786 states and 47656 transitions. [2019-09-08 10:37:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:37:54,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:37:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:54,628 INFO L225 Difference]: With dead ends: 33786 [2019-09-08 10:37:54,628 INFO L226 Difference]: Without dead ends: 33784 [2019-09-08 10:37:54,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:37:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33784 states. [2019-09-08 10:37:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33784 to 20126. [2019-09-08 10:37:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20126 states. [2019-09-08 10:37:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 28339 transitions. [2019-09-08 10:37:57,693 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 28339 transitions. Word has length 70 [2019-09-08 10:37:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:57,694 INFO L475 AbstractCegarLoop]: Abstraction has 20126 states and 28339 transitions. [2019-09-08 10:37:57,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:37:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 28339 transitions. [2019-09-08 10:37:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:37:57,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:57,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:57,699 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2055411099, now seen corresponding path program 1 times [2019-09-08 10:37:57,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:57,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:57,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:57,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:37:57,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:37:57,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:37:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:37:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:37:57,759 INFO L87 Difference]: Start difference. First operand 20126 states and 28339 transitions. Second operand 3 states. [2019-09-08 10:38:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:03,137 INFO L93 Difference]: Finished difference Result 54598 states and 77067 transitions. [2019-09-08 10:38:03,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:38:03,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 10:38:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:03,179 INFO L225 Difference]: With dead ends: 54598 [2019-09-08 10:38:03,179 INFO L226 Difference]: Without dead ends: 35124 [2019-09-08 10:38:03,195 INFO L628 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-09-08 10:38:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35124 states. [2019-09-08 10:38:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35124 to 34658. [2019-09-08 10:38:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34658 states. [2019-09-08 10:38:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34658 states to 34658 states and 48205 transitions. [2019-09-08 10:38:09,178 INFO L78 Accepts]: Start accepts. Automaton has 34658 states and 48205 transitions. Word has length 71 [2019-09-08 10:38:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:09,179 INFO L475 AbstractCegarLoop]: Abstraction has 34658 states and 48205 transitions. [2019-09-08 10:38:09,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:38:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 34658 states and 48205 transitions. [2019-09-08 10:38:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:38:09,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:09,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:38:09,184 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1175358734, now seen corresponding path program 1 times [2019-09-08 10:38:09,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:09,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:09,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:09,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:09,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:09,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:09,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:38:09,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:38:09,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:38:09,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:38:09,255 INFO L87 Difference]: Start difference. First operand 34658 states and 48205 transitions. Second operand 3 states. [2019-09-08 10:38:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:14,474 INFO L93 Difference]: Finished difference Result 39408 states and 54733 transitions. [2019-09-08 10:38:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:38:14,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 10:38:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:14,508 INFO L225 Difference]: With dead ends: 39408 [2019-09-08 10:38:14,508 INFO L226 Difference]: Without dead ends: 34643 [2019-09-08 10:38:14,516 INFO L628 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-09-08 10:38:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34643 states. [2019-09-08 10:38:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34643 to 29491. [2019-09-08 10:38:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29491 states. [2019-09-08 10:38:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29491 states to 29491 states and 40824 transitions. [2019-09-08 10:38:18,987 INFO L78 Accepts]: Start accepts. Automaton has 29491 states and 40824 transitions. Word has length 72 [2019-09-08 10:38:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:18,988 INFO L475 AbstractCegarLoop]: Abstraction has 29491 states and 40824 transitions. [2019-09-08 10:38:18,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:38:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29491 states and 40824 transitions. [2019-09-08 10:38:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:38:18,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:18,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:38:18,992 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash 353507174, now seen corresponding path program 1 times [2019-09-08 10:38:18,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:18,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:19,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:19,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:38:19,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:38:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:38:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:38:19,058 INFO L87 Difference]: Start difference. First operand 29491 states and 40824 transitions. Second operand 5 states. [2019-09-08 10:38:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:35,087 INFO L93 Difference]: Finished difference Result 120943 states and 167686 transitions. [2019-09-08 10:38:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:38:35,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 10:38:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:35,197 INFO L225 Difference]: With dead ends: 120943 [2019-09-08 10:38:35,198 INFO L226 Difference]: Without dead ends: 92094 [2019-09-08 10:38:35,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:38:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92094 states. [2019-09-08 10:38:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92094 to 48003. [2019-09-08 10:38:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48003 states. [2019-09-08 10:38:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48003 states to 48003 states and 65438 transitions. [2019-09-08 10:38:44,781 INFO L78 Accepts]: Start accepts. Automaton has 48003 states and 65438 transitions. Word has length 74 [2019-09-08 10:38:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:44,781 INFO L475 AbstractCegarLoop]: Abstraction has 48003 states and 65438 transitions. [2019-09-08 10:38:44,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:38:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 48003 states and 65438 transitions. [2019-09-08 10:38:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:38:44,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:44,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:38:44,787 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:44,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2143339772, now seen corresponding path program 1 times [2019-09-08 10:38:44,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:44,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:38:44,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:44,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:38:44,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:38:44,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:38:44,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:38:44,870 INFO L87 Difference]: Start difference. First operand 48003 states and 65438 transitions. Second operand 5 states. [2019-09-08 10:39:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:09,597 INFO L93 Difference]: Finished difference Result 193165 states and 263134 transitions. [2019-09-08 10:39:09,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:39:09,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 10:39:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:09,783 INFO L225 Difference]: With dead ends: 193165 [2019-09-08 10:39:09,783 INFO L226 Difference]: Without dead ends: 145806 [2019-09-08 10:39:09,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:39:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145806 states. [2019-09-08 10:39:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145806 to 94964. [2019-09-08 10:39:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94964 states. [2019-09-08 10:39:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94964 states to 94964 states and 128949 transitions. [2019-09-08 10:39:27,574 INFO L78 Accepts]: Start accepts. Automaton has 94964 states and 128949 transitions. Word has length 77 [2019-09-08 10:39:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:27,574 INFO L475 AbstractCegarLoop]: Abstraction has 94964 states and 128949 transitions. [2019-09-08 10:39:27,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:39:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 94964 states and 128949 transitions. [2019-09-08 10:39:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:39:27,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:27,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:39:27,579 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1797768461, now seen corresponding path program 1 times [2019-09-08 10:39:27,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:27,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:39:27,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:27,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:39:27,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:39:27,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:39:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:39:27,703 INFO L87 Difference]: Start difference. First operand 94964 states and 128949 transitions. Second operand 6 states. [2019-09-08 10:39:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:49,782 INFO L93 Difference]: Finished difference Result 164756 states and 224258 transitions. [2019-09-08 10:39:49,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:39:49,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-08 10:39:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:49,930 INFO L225 Difference]: With dead ends: 164756 [2019-09-08 10:39:49,930 INFO L226 Difference]: Without dead ends: 121646 [2019-09-08 10:39:49,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:39:50,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121646 states. [2019-09-08 10:40:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121646 to 111168. [2019-09-08 10:40:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111168 states. [2019-09-08 10:40:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111168 states to 111168 states and 150647 transitions. [2019-09-08 10:40:10,602 INFO L78 Accepts]: Start accepts. Automaton has 111168 states and 150647 transitions. Word has length 79 [2019-09-08 10:40:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:10,602 INFO L475 AbstractCegarLoop]: Abstraction has 111168 states and 150647 transitions. [2019-09-08 10:40:10,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:40:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 111168 states and 150647 transitions. [2019-09-08 10:40:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:40:10,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:10,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:10,608 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1867381610, now seen corresponding path program 1 times [2019-09-08 10:40:10,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:10,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:10,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:10,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:10,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:40:10,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:40:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:40:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:40:10,676 INFO L87 Difference]: Start difference. First operand 111168 states and 150647 transitions. Second operand 3 states. [2019-09-08 10:40:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:30,158 INFO L93 Difference]: Finished difference Result 218097 states and 294650 transitions. [2019-09-08 10:40:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:40:30,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 10:40:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:30,300 INFO L225 Difference]: With dead ends: 218097 [2019-09-08 10:40:30,300 INFO L226 Difference]: Without dead ends: 107578 [2019-09-08 10:40:30,372 INFO L628 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-09-08 10:40:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107578 states. [2019-09-08 10:40:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107578 to 88329. [2019-09-08 10:40:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88329 states. [2019-09-08 10:40:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88329 states to 88329 states and 117161 transitions. [2019-09-08 10:40:48,693 INFO L78 Accepts]: Start accepts. Automaton has 88329 states and 117161 transitions. Word has length 79 [2019-09-08 10:40:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:48,693 INFO L475 AbstractCegarLoop]: Abstraction has 88329 states and 117161 transitions. [2019-09-08 10:40:48,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:40:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 88329 states and 117161 transitions. [2019-09-08 10:40:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:40:48,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:48,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:48,698 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash 874030055, now seen corresponding path program 1 times [2019-09-08 10:40:48,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:48,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:48,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:48,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:48,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:40:48,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:40:48,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:40:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:40:48,756 INFO L87 Difference]: Start difference. First operand 88329 states and 117161 transitions. Second operand 3 states. [2019-09-08 10:41:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:08,411 INFO L93 Difference]: Finished difference Result 190825 states and 252633 transitions. [2019-09-08 10:41:08,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:08,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:41:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:08,558 INFO L225 Difference]: With dead ends: 190825 [2019-09-08 10:41:08,558 INFO L226 Difference]: Without dead ends: 103097 [2019-09-08 10:41:08,625 INFO L628 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-09-08 10:41:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103097 states. [2019-09-08 10:41:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103097 to 98394. [2019-09-08 10:41:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98394 states. [2019-09-08 10:41:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98394 states to 98394 states and 129185 transitions. [2019-09-08 10:41:28,832 INFO L78 Accepts]: Start accepts. Automaton has 98394 states and 129185 transitions. Word has length 82 [2019-09-08 10:41:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:28,832 INFO L475 AbstractCegarLoop]: Abstraction has 98394 states and 129185 transitions. [2019-09-08 10:41:28,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 98394 states and 129185 transitions. [2019-09-08 10:41:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 10:41:28,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:28,840 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:41:28,840 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1798700343, now seen corresponding path program 1 times [2019-09-08 10:41:28,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:28,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:28,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:28,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:28,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:28,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:28,912 INFO L87 Difference]: Start difference. First operand 98394 states and 129185 transitions. Second operand 3 states. [2019-09-08 10:42:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:04,429 INFO L93 Difference]: Finished difference Result 274215 states and 358098 transitions. [2019-09-08 10:42:04,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:42:04,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 10:42:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:04,651 INFO L225 Difference]: With dead ends: 274215 [2019-09-08 10:42:04,652 INFO L226 Difference]: Without dead ends: 176422 [2019-09-08 10:42:04,719 INFO L628 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-09-08 10:42:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176422 states. [2019-09-08 10:42:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176422 to 155281. [2019-09-08 10:42:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155281 states. [2019-09-08 10:42:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155281 states to 155281 states and 200125 transitions. [2019-09-08 10:42:37,463 INFO L78 Accepts]: Start accepts. Automaton has 155281 states and 200125 transitions. Word has length 90 [2019-09-08 10:42:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:37,463 INFO L475 AbstractCegarLoop]: Abstraction has 155281 states and 200125 transitions. [2019-09-08 10:42:37,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:42:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 155281 states and 200125 transitions. [2019-09-08 10:42:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 10:42:37,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:37,473 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:42:37,473 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 25741144, now seen corresponding path program 1 times [2019-09-08 10:42:37,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:37,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:37,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:37,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:37,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:42:37,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:37,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:42:37,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:42:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:42:37,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:42:37,630 INFO L87 Difference]: Start difference. First operand 155281 states and 200125 transitions. Second operand 9 states. [2019-09-08 10:43:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:56,881 INFO L93 Difference]: Finished difference Result 412184 states and 529361 transitions. [2019-09-08 10:43:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:43:56,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-08 10:43:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:57,403 INFO L225 Difference]: With dead ends: 412184 [2019-09-08 10:43:57,404 INFO L226 Difference]: Without dead ends: 383010 [2019-09-08 10:43:57,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:43:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383010 states. [2019-09-08 10:44:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383010 to 155266. [2019-09-08 10:44:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155266 states. [2019-09-08 10:44:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155266 states to 155266 states and 200109 transitions. [2019-09-08 10:44:34,810 INFO L78 Accepts]: Start accepts. Automaton has 155266 states and 200109 transitions. Word has length 92 [2019-09-08 10:44:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:34,811 INFO L475 AbstractCegarLoop]: Abstraction has 155266 states and 200109 transitions. [2019-09-08 10:44:34,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:44:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 155266 states and 200109 transitions. [2019-09-08 10:44:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 10:44:34,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:34,820 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:44:34,821 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash -978519268, now seen corresponding path program 1 times [2019-09-08 10:44:34,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:34,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:34,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:34,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:35,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:35,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:44:35,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:44:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:44:35,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:44:35,061 INFO L87 Difference]: Start difference. First operand 155266 states and 200109 transitions. Second operand 10 states. [2019-09-08 10:46:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:33,303 INFO L93 Difference]: Finished difference Result 600810 states and 769547 transitions. [2019-09-08 10:46:33,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:46:33,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-09-08 10:46:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:34,090 INFO L225 Difference]: With dead ends: 600810 [2019-09-08 10:46:34,091 INFO L226 Difference]: Without dead ends: 523916 [2019-09-08 10:46:34,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 10:46:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523916 states. [2019-09-08 10:47:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523916 to 251228. [2019-09-08 10:47:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251228 states. [2019-09-08 10:47:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251228 states to 251228 states and 323622 transitions. [2019-09-08 10:47:33,288 INFO L78 Accepts]: Start accepts. Automaton has 251228 states and 323622 transitions. Word has length 93 [2019-09-08 10:47:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:33,288 INFO L475 AbstractCegarLoop]: Abstraction has 251228 states and 323622 transitions. [2019-09-08 10:47:33,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:47:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 251228 states and 323622 transitions. [2019-09-08 10:47:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 10:47:33,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:33,300 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 10:47:33,300 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:33,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash -287132240, now seen corresponding path program 1 times [2019-09-08 10:47:33,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:33,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:33,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:47:33,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:33,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:47:33,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:47:33,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:47:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:47:33,448 INFO L87 Difference]: Start difference. First operand 251228 states and 323622 transitions. Second operand 9 states.