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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:34:28,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:34:28,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:34:28,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:34:28,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:34:28,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:34:28,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:34:28,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:34:28,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:34:28,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:34:28,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:34:28,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:34:28,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:34:28,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:34:28,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:34:28,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:34:28,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:34:28,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:34:28,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:34:28,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:34:28,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:34:28,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:34:28,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:34:28,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:34:28,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:34:28,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:34:28,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:34:28,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:34:28,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:34:28,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:34:28,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:34:28,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:34:28,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:34:28,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:34:28,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:34:28,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:34:28,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:34:28,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:34:28,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:34:28,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:34:28,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:34:28,336 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:34:28,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:34:28,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:34:28,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:34:28,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:34:28,359 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:34:28,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:34:28,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:34:28,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:34:28,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:34:28,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:34:28,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:34:28,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:34:28,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:34:28,361 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:34:28,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:34:28,361 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:34:28,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:34:28,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:34:28,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:34:28,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:34:28,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:34:28,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:34:28,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:34:28,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:34:28,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:34:28,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:34:28,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:34:28,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:34:28,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:34:28,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:34:28,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:34:28,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:34:28,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:34:28,438 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:34:28,439 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+lhb-reducer.c [2019-09-08 10:34:28,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96dfc0f0f/6094acf2a45e499fa033268cba73552c/FLAGf22e0f622 [2019-09-08 10:34:29,155 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:34:29,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:34:29,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96dfc0f0f/6094acf2a45e499fa033268cba73552c/FLAGf22e0f622 [2019-09-08 10:34:29,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96dfc0f0f/6094acf2a45e499fa033268cba73552c [2019-09-08 10:34:29,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:34:29,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:34:29,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:34:29,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:34:29,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:34:29,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:34:29" (1/1) ... [2019-09-08 10:34:29,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cd6955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:29, skipping insertion in model container [2019-09-08 10:34:29,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:34:29" (1/1) ... [2019-09-08 10:34:29,441 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:34:29,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:34:30,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:34:30,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:34:30,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:34:30,829 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:34:30,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30 WrapperNode [2019-09-08 10:34:30,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:34:30,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:34:30,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:34:30,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:34:30,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... [2019-09-08 10:34:30,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... [2019-09-08 10:34:30,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... [2019-09-08 10:34:30,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... [2019-09-08 10:34:30,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... [2019-09-08 10:34:30,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... [2019-09-08 10:34:30,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... [2019-09-08 10:34:30,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:34:30,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:34:30,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:34:30,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:34:30,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:34:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:34:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:34:31,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:34:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:34:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:34:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:34:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:34:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:34:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:34:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:34:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:34:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:34:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:34:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:34:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:34:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:34:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:34:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:34:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:34:33,061 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:34:33,061 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:34:33,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:34:33 BoogieIcfgContainer [2019-09-08 10:34:33,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:34:33,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:34:33,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:34:33,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:34:33,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:34:29" (1/3) ... [2019-09-08 10:34:33,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dfaaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:34:33, skipping insertion in model container [2019-09-08 10:34:33,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:34:30" (2/3) ... [2019-09-08 10:34:33,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dfaaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:34:33, skipping insertion in model container [2019-09-08 10:34:33,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:34:33" (3/3) ... [2019-09-08 10:34:33,071 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:34:33,081 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:34:33,091 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-08 10:34:33,112 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-08 10:34:33,154 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:34:33,155 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:34:33,155 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:34:33,156 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:34:33,156 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:34:33,156 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:34:33,156 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:34:33,156 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:34:33,157 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:34:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states. [2019-09-08 10:34:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:34:33,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:33,213 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] [2019-09-08 10:34:33,216 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:33,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash 769372493, now seen corresponding path program 1 times [2019-09-08 10:34:33,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:33,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:33,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:33,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:33,702 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:34:33,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:33,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:33,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:33,727 INFO L87 Difference]: Start difference. First operand 461 states. Second operand 5 states. [2019-09-08 10:34:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:34,434 INFO L93 Difference]: Finished difference Result 841 states and 1480 transitions. [2019-09-08 10:34:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:34,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-08 10:34:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:34,457 INFO L225 Difference]: With dead ends: 841 [2019-09-08 10:34:34,457 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 10:34:34,463 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:34:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 10:34:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 482. [2019-09-08 10:34:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-08 10:34:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 656 transitions. [2019-09-08 10:34:34,567 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 656 transitions. Word has length 54 [2019-09-08 10:34:34,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:34,568 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 656 transitions. [2019-09-08 10:34:34,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:34:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 656 transitions. [2019-09-08 10:34:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:34:34,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:34,575 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:34:34,577 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:34,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:34,578 INFO L82 PathProgramCache]: Analyzing trace with hash 861483672, now seen corresponding path program 1 times [2019-09-08 10:34:34,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:34,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:34,727 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:34:34,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:34,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:34,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:34,731 INFO L87 Difference]: Start difference. First operand 482 states and 656 transitions. Second operand 3 states. [2019-09-08 10:34:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:34,813 INFO L93 Difference]: Finished difference Result 886 states and 1230 transitions. [2019-09-08 10:34:34,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:34,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:34:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:34,818 INFO L225 Difference]: With dead ends: 886 [2019-09-08 10:34:34,818 INFO L226 Difference]: Without dead ends: 661 [2019-09-08 10:34:34,820 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:34:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-08 10:34:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 653. [2019-09-08 10:34:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-08 10:34:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 880 transitions. [2019-09-08 10:34:34,856 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 880 transitions. Word has length 55 [2019-09-08 10:34:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:34,857 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 880 transitions. [2019-09-08 10:34:34,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 880 transitions. [2019-09-08 10:34:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:34:34,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:34,860 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:34:34,860 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash 481355333, now seen corresponding path program 1 times [2019-09-08 10:34:34,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:34,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:34,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:34,972 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:34:34,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:34,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:34,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:34,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:34,974 INFO L87 Difference]: Start difference. First operand 653 states and 880 transitions. Second operand 3 states. [2019-09-08 10:34:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:35,051 INFO L93 Difference]: Finished difference Result 1244 states and 1745 transitions. [2019-09-08 10:34:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:35,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:34:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:35,062 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 10:34:35,062 INFO L226 Difference]: Without dead ends: 917 [2019-09-08 10:34:35,064 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:34:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-08 10:34:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 911. [2019-09-08 10:34:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-09-08 10:34:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1252 transitions. [2019-09-08 10:34:35,117 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1252 transitions. Word has length 55 [2019-09-08 10:34:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:35,119 INFO L475 AbstractCegarLoop]: Abstraction has 911 states and 1252 transitions. [2019-09-08 10:34:35,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1252 transitions. [2019-09-08 10:34:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:34:35,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:35,122 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:34:35,123 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2053812510, now seen corresponding path program 1 times [2019-09-08 10:34:35,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:35,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:35,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:35,298 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:34:35,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:35,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:34:35,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:34:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:34:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:34:35,300 INFO L87 Difference]: Start difference. First operand 911 states and 1252 transitions. Second operand 6 states. [2019-09-08 10:34:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:35,793 INFO L93 Difference]: Finished difference Result 2228 states and 3160 transitions. [2019-09-08 10:34:35,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:35,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-08 10:34:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:35,802 INFO L225 Difference]: With dead ends: 2228 [2019-09-08 10:34:35,802 INFO L226 Difference]: Without dead ends: 1492 [2019-09-08 10:34:35,804 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:34:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-09-08 10:34:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1474. [2019-09-08 10:34:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2019-09-08 10:34:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2095 transitions. [2019-09-08 10:34:35,873 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2095 transitions. Word has length 55 [2019-09-08 10:34:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:35,873 INFO L475 AbstractCegarLoop]: Abstraction has 1474 states and 2095 transitions. [2019-09-08 10:34:35,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:34:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2095 transitions. [2019-09-08 10:34:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:34:35,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:35,876 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:34:35,876 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:35,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash 287776612, now seen corresponding path program 1 times [2019-09-08 10:34:35,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:35,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:35,967 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:34:35,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:35,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:34:35,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:34:35,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:34:35,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:34:35,969 INFO L87 Difference]: Start difference. First operand 1474 states and 2095 transitions. Second operand 6 states. [2019-09-08 10:34:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:36,578 INFO L93 Difference]: Finished difference Result 4627 states and 6688 transitions. [2019-09-08 10:34:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:34:36,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:34:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:36,598 INFO L225 Difference]: With dead ends: 4627 [2019-09-08 10:34:36,598 INFO L226 Difference]: Without dead ends: 3328 [2019-09-08 10:34:36,603 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:34:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-09-08 10:34:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3313. [2019-09-08 10:34:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3313 states. [2019-09-08 10:34:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4753 transitions. [2019-09-08 10:34:36,812 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4753 transitions. Word has length 56 [2019-09-08 10:34:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:36,812 INFO L475 AbstractCegarLoop]: Abstraction has 3313 states and 4753 transitions. [2019-09-08 10:34:36,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:34:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4753 transitions. [2019-09-08 10:34:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:34:36,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:36,815 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:34:36,816 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:36,816 INFO L82 PathProgramCache]: Analyzing trace with hash 393817543, now seen corresponding path program 1 times [2019-09-08 10:34:36,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:36,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:36,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:36,885 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:34:36,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:36,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:36,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:36,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:36,886 INFO L87 Difference]: Start difference. First operand 3313 states and 4753 transitions. Second operand 3 states. [2019-09-08 10:34:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:37,141 INFO L93 Difference]: Finished difference Result 7481 states and 10868 transitions. [2019-09-08 10:34:37,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:37,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:34:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:37,169 INFO L225 Difference]: With dead ends: 7481 [2019-09-08 10:34:37,169 INFO L226 Difference]: Without dead ends: 4771 [2019-09-08 10:34:37,176 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:34:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2019-09-08 10:34:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4734. [2019-09-08 10:34:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4734 states. [2019-09-08 10:34:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6745 transitions. [2019-09-08 10:34:37,443 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6745 transitions. Word has length 56 [2019-09-08 10:34:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:37,443 INFO L475 AbstractCegarLoop]: Abstraction has 4734 states and 6745 transitions. [2019-09-08 10:34:37,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6745 transitions. [2019-09-08 10:34:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:34:37,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:37,447 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:34:37,447 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1900631734, now seen corresponding path program 1 times [2019-09-08 10:34:37,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:37,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:37,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:37,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:37,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:34:37,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:37,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:34:37,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:34:37,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:34:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:37,544 INFO L87 Difference]: Start difference. First operand 4734 states and 6745 transitions. Second operand 7 states. [2019-09-08 10:34:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:39,073 INFO L93 Difference]: Finished difference Result 22966 states and 33179 transitions. [2019-09-08 10:34:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:34:39,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:34:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:39,160 INFO L225 Difference]: With dead ends: 22966 [2019-09-08 10:34:39,160 INFO L226 Difference]: Without dead ends: 20571 [2019-09-08 10:34:39,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:34:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20571 states. [2019-09-08 10:34:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20571 to 4768. [2019-09-08 10:34:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4768 states. [2019-09-08 10:34:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 6789 transitions. [2019-09-08 10:34:39,838 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 6789 transitions. Word has length 57 [2019-09-08 10:34:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:39,838 INFO L475 AbstractCegarLoop]: Abstraction has 4768 states and 6789 transitions. [2019-09-08 10:34:39,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:34:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 6789 transitions. [2019-09-08 10:34:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:34:39,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:39,842 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:34:39,843 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1596178184, now seen corresponding path program 1 times [2019-09-08 10:34:39,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:39,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:39,964 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:34:39,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:39,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:34:39,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:34:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:34:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:39,967 INFO L87 Difference]: Start difference. First operand 4768 states and 6789 transitions. Second operand 7 states. [2019-09-08 10:34:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:41,697 INFO L93 Difference]: Finished difference Result 17585 states and 25385 transitions. [2019-09-08 10:34:41,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:34:41,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:34:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:41,735 INFO L225 Difference]: With dead ends: 17585 [2019-09-08 10:34:41,736 INFO L226 Difference]: Without dead ends: 15704 [2019-09-08 10:34:41,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:34:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15704 states. [2019-09-08 10:34:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15704 to 4790. [2019-09-08 10:34:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-09-08 10:34:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 6820 transitions. [2019-09-08 10:34:42,223 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 6820 transitions. Word has length 57 [2019-09-08 10:34:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:42,223 INFO L475 AbstractCegarLoop]: Abstraction has 4790 states and 6820 transitions. [2019-09-08 10:34:42,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:34:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 6820 transitions. [2019-09-08 10:34:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:34:42,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:42,226 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:34:42,227 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:42,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:42,227 INFO L82 PathProgramCache]: Analyzing trace with hash -728834285, now seen corresponding path program 1 times [2019-09-08 10:34:42,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:42,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:42,341 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:34:42,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:42,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:34:42,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:34:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:34:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:34:42,343 INFO L87 Difference]: Start difference. First operand 4790 states and 6820 transitions. Second operand 7 states. [2019-09-08 10:34:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:43,856 INFO L93 Difference]: Finished difference Result 15870 states and 22900 transitions. [2019-09-08 10:34:43,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:34:43,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:34:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:43,885 INFO L225 Difference]: With dead ends: 15870 [2019-09-08 10:34:43,885 INFO L226 Difference]: Without dead ends: 13732 [2019-09-08 10:34:43,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:34:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2019-09-08 10:34:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 4804. [2019-09-08 10:34:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4804 states. [2019-09-08 10:34:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6838 transitions. [2019-09-08 10:34:44,393 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6838 transitions. Word has length 57 [2019-09-08 10:34:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:44,393 INFO L475 AbstractCegarLoop]: Abstraction has 4804 states and 6838 transitions. [2019-09-08 10:34:44,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:34:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6838 transitions. [2019-09-08 10:34:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:34:44,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:44,397 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:34:44,398 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -400384619, now seen corresponding path program 1 times [2019-09-08 10:34:44,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:44,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:44,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:44,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:44,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:44,573 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:34:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:34:44,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:34:44,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:34:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:34:44,575 INFO L87 Difference]: Start difference. First operand 4804 states and 6838 transitions. Second operand 9 states. [2019-09-08 10:34:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:47,847 INFO L93 Difference]: Finished difference Result 20964 states and 30442 transitions. [2019-09-08 10:34:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:34:47,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:34:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:47,878 INFO L225 Difference]: With dead ends: 20964 [2019-09-08 10:34:47,878 INFO L226 Difference]: Without dead ends: 17600 [2019-09-08 10:34:47,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:34:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17600 states. [2019-09-08 10:34:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17600 to 4770. [2019-09-08 10:34:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4770 states. [2019-09-08 10:34:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 6792 transitions. [2019-09-08 10:34:48,398 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 6792 transitions. Word has length 58 [2019-09-08 10:34:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:48,399 INFO L475 AbstractCegarLoop]: Abstraction has 4770 states and 6792 transitions. [2019-09-08 10:34:48,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:34:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 6792 transitions. [2019-09-08 10:34:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:34:48,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:48,403 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:34:48,403 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1454445203, now seen corresponding path program 1 times [2019-09-08 10:34:48,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:48,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:48,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:48,546 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:34:48,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:48,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:34:48,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:34:48,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:34:48,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:34:48,547 INFO L87 Difference]: Start difference. First operand 4770 states and 6792 transitions. Second operand 9 states. [2019-09-08 10:34:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:50,535 INFO L93 Difference]: Finished difference Result 10677 states and 15466 transitions. [2019-09-08 10:34:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:34:50,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:34:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:50,550 INFO L225 Difference]: With dead ends: 10677 [2019-09-08 10:34:50,550 INFO L226 Difference]: Without dead ends: 10672 [2019-09-08 10:34:50,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:34:50,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10672 states. [2019-09-08 10:34:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10672 to 4770. [2019-09-08 10:34:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4770 states. [2019-09-08 10:34:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 6790 transitions. [2019-09-08 10:34:51,184 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 6790 transitions. Word has length 58 [2019-09-08 10:34:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:51,184 INFO L475 AbstractCegarLoop]: Abstraction has 4770 states and 6790 transitions. [2019-09-08 10:34:51,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:34:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 6790 transitions. [2019-09-08 10:34:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:34:51,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:51,188 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:34:51,188 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash -780512958, now seen corresponding path program 1 times [2019-09-08 10:34:51,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:51,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:51,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:51,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:51,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:51,303 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:34:51,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:51,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:34:51,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:34:51,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:34:51,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:34:51,305 INFO L87 Difference]: Start difference. First operand 4770 states and 6790 transitions. Second operand 8 states. [2019-09-08 10:34:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:53,465 INFO L93 Difference]: Finished difference Result 17321 states and 25268 transitions. [2019-09-08 10:34:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:34:53,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-08 10:34:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:53,484 INFO L225 Difference]: With dead ends: 17321 [2019-09-08 10:34:53,484 INFO L226 Difference]: Without dead ends: 13583 [2019-09-08 10:34:53,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:34:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13583 states. [2019-09-08 10:34:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13583 to 4605. [2019-09-08 10:34:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2019-09-08 10:34:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6568 transitions. [2019-09-08 10:34:53,957 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6568 transitions. Word has length 58 [2019-09-08 10:34:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:53,957 INFO L475 AbstractCegarLoop]: Abstraction has 4605 states and 6568 transitions. [2019-09-08 10:34:53,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:34:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6568 transitions. [2019-09-08 10:34:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:34:53,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:53,960 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:34:53,960 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400580, now seen corresponding path program 1 times [2019-09-08 10:34:53,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:53,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:53,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:53,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:54,029 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:34:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:54,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:54,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:54,030 INFO L87 Difference]: Start difference. First operand 4605 states and 6568 transitions. Second operand 3 states. [2019-09-08 10:34:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:54,542 INFO L93 Difference]: Finished difference Result 6694 states and 9594 transitions. [2019-09-08 10:34:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:54,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:34:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:54,548 INFO L225 Difference]: With dead ends: 6694 [2019-09-08 10:34:54,548 INFO L226 Difference]: Without dead ends: 4611 [2019-09-08 10:34:54,554 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:34:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2019-09-08 10:34:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4605. [2019-09-08 10:34:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2019-09-08 10:34:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6498 transitions. [2019-09-08 10:34:55,042 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6498 transitions. Word has length 59 [2019-09-08 10:34:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:55,043 INFO L475 AbstractCegarLoop]: Abstraction has 4605 states and 6498 transitions. [2019-09-08 10:34:55,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6498 transitions. [2019-09-08 10:34:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:34:55,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:55,046 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:34:55,046 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1203643884, now seen corresponding path program 1 times [2019-09-08 10:34:55,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:55,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:55,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:55,104 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:34:55,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:55,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:55,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:55,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:55,106 INFO L87 Difference]: Start difference. First operand 4605 states and 6498 transitions. Second operand 3 states. [2019-09-08 10:34:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:55,598 INFO L93 Difference]: Finished difference Result 6632 states and 9404 transitions. [2019-09-08 10:34:55,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:55,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:34:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:55,603 INFO L225 Difference]: With dead ends: 6632 [2019-09-08 10:34:55,603 INFO L226 Difference]: Without dead ends: 4612 [2019-09-08 10:34:55,608 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:34:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4612 states. [2019-09-08 10:34:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4612 to 4605. [2019-09-08 10:34:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4605 states. [2019-09-08 10:34:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6423 transitions. [2019-09-08 10:34:55,989 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6423 transitions. Word has length 59 [2019-09-08 10:34:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:55,990 INFO L475 AbstractCegarLoop]: Abstraction has 4605 states and 6423 transitions. [2019-09-08 10:34:55,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6423 transitions. [2019-09-08 10:34:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:34:55,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:55,993 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:34:55,993 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 776650189, now seen corresponding path program 1 times [2019-09-08 10:34:55,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:55,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:55,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:55,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:55,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:56,068 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:34:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:56,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:56,070 INFO L87 Difference]: Start difference. First operand 4605 states and 6423 transitions. Second operand 3 states. [2019-09-08 10:34:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:56,598 INFO L93 Difference]: Finished difference Result 7126 states and 9975 transitions. [2019-09-08 10:34:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:56,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:34:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:56,603 INFO L225 Difference]: With dead ends: 7126 [2019-09-08 10:34:56,603 INFO L226 Difference]: Without dead ends: 4571 [2019-09-08 10:34:56,608 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:34:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2019-09-08 10:34:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4565. [2019-09-08 10:34:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-09-08 10:34:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 6278 transitions. [2019-09-08 10:34:57,022 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 6278 transitions. Word has length 59 [2019-09-08 10:34:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:57,022 INFO L475 AbstractCegarLoop]: Abstraction has 4565 states and 6278 transitions. [2019-09-08 10:34:57,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 6278 transitions. [2019-09-08 10:34:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:34:57,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:57,025 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:34:57,026 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1527639271, now seen corresponding path program 1 times [2019-09-08 10:34:57,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:57,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:57,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:57,083 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:34:57,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:57,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:57,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:57,085 INFO L87 Difference]: Start difference. First operand 4565 states and 6278 transitions. Second operand 3 states. [2019-09-08 10:34:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:57,724 INFO L93 Difference]: Finished difference Result 8428 states and 11706 transitions. [2019-09-08 10:34:57,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:57,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:34:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:57,730 INFO L225 Difference]: With dead ends: 8428 [2019-09-08 10:34:57,731 INFO L226 Difference]: Without dead ends: 5704 [2019-09-08 10:34:57,735 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:34:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2019-09-08 10:34:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 4184. [2019-09-08 10:34:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4184 states. [2019-09-08 10:34:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 5772 transitions. [2019-09-08 10:34:58,113 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 5772 transitions. Word has length 60 [2019-09-08 10:34:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:58,113 INFO L475 AbstractCegarLoop]: Abstraction has 4184 states and 5772 transitions. [2019-09-08 10:34:58,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 5772 transitions. [2019-09-08 10:34:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:34:58,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:58,116 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:34:58,116 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash -306322079, now seen corresponding path program 1 times [2019-09-08 10:34:58,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:58,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:58,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:58,168 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:34:58,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:58,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:58,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:58,170 INFO L87 Difference]: Start difference. First operand 4184 states and 5772 transitions. Second operand 3 states. [2019-09-08 10:34:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:58,843 INFO L93 Difference]: Finished difference Result 8174 states and 11413 transitions. [2019-09-08 10:34:58,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:34:58,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:34:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:58,849 INFO L225 Difference]: With dead ends: 8174 [2019-09-08 10:34:58,850 INFO L226 Difference]: Without dead ends: 5860 [2019-09-08 10:34:58,854 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:34:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2019-09-08 10:34:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 4123. [2019-09-08 10:34:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4123 states. [2019-09-08 10:34:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5685 transitions. [2019-09-08 10:34:59,266 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5685 transitions. Word has length 61 [2019-09-08 10:34:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:59,266 INFO L475 AbstractCegarLoop]: Abstraction has 4123 states and 5685 transitions. [2019-09-08 10:34:59,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:34:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5685 transitions. [2019-09-08 10:34:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:34:59,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:59,268 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:34:59,268 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1076067543, now seen corresponding path program 1 times [2019-09-08 10:34:59,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:59,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:59,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:59,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:59,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:59,320 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:34:59,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:59,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:34:59,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:34:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:34:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:34:59,322 INFO L87 Difference]: Start difference. First operand 4123 states and 5685 transitions. Second operand 3 states. [2019-09-08 10:35:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:00,003 INFO L93 Difference]: Finished difference Result 8065 states and 11246 transitions. [2019-09-08 10:35:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:35:00,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:35:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:00,012 INFO L225 Difference]: With dead ends: 8065 [2019-09-08 10:35:00,012 INFO L226 Difference]: Without dead ends: 5775 [2019-09-08 10:35:00,017 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:35:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2019-09-08 10:35:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 4036. [2019-09-08 10:35:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4036 states. [2019-09-08 10:35:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5568 transitions. [2019-09-08 10:35:00,528 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5568 transitions. Word has length 61 [2019-09-08 10:35:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:00,528 INFO L475 AbstractCegarLoop]: Abstraction has 4036 states and 5568 transitions. [2019-09-08 10:35:00,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:35:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5568 transitions. [2019-09-08 10:35:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:35:00,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:00,530 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:35:00,530 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:00,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:00,531 INFO L82 PathProgramCache]: Analyzing trace with hash -69771348, now seen corresponding path program 1 times [2019-09-08 10:35:00,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:00,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:01,039 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:35:01,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:01,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:35:01,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:35:01,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:35:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:35:01,041 INFO L87 Difference]: Start difference. First operand 4036 states and 5568 transitions. Second operand 13 states. [2019-09-08 10:35:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:02,879 INFO L93 Difference]: Finished difference Result 5374 states and 7448 transitions. [2019-09-08 10:35:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:35:02,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-08 10:35:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:02,885 INFO L225 Difference]: With dead ends: 5374 [2019-09-08 10:35:02,885 INFO L226 Difference]: Without dead ends: 5370 [2019-09-08 10:35:02,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:35:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-09-08 10:35:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 4032. [2019-09-08 10:35:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4032 states. [2019-09-08 10:35:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5564 transitions. [2019-09-08 10:35:03,480 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5564 transitions. Word has length 61 [2019-09-08 10:35:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:03,480 INFO L475 AbstractCegarLoop]: Abstraction has 4032 states and 5564 transitions. [2019-09-08 10:35:03,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:35:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5564 transitions. [2019-09-08 10:35:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:35:03,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:03,482 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:35:03,482 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1711838127, now seen corresponding path program 1 times [2019-09-08 10:35:03,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:03,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:03,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:03,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:03,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:03,903 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:35:03,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:03,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:35:03,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:35:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:35:03,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:35:03,905 INFO L87 Difference]: Start difference. First operand 4032 states and 5564 transitions. Second operand 12 states. [2019-09-08 10:35:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:06,090 INFO L93 Difference]: Finished difference Result 7655 states and 10684 transitions. [2019-09-08 10:35:06,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:35:06,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-08 10:35:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:06,099 INFO L225 Difference]: With dead ends: 7655 [2019-09-08 10:35:06,099 INFO L226 Difference]: Without dead ends: 7468 [2019-09-08 10:35:06,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:35:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7468 states. [2019-09-08 10:35:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7468 to 4031. [2019-09-08 10:35:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-09-08 10:35:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5562 transitions. [2019-09-08 10:35:06,698 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5562 transitions. Word has length 61 [2019-09-08 10:35:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:06,699 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5562 transitions. [2019-09-08 10:35:06,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:35:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5562 transitions. [2019-09-08 10:35:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:35:06,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:06,700 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:35:06,701 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1267518257, now seen corresponding path program 1 times [2019-09-08 10:35:06,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:06,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:07,416 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:35:07,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:07,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:35:07,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:35:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:35:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:35:07,418 INFO L87 Difference]: Start difference. First operand 4031 states and 5562 transitions. Second operand 16 states. [2019-09-08 10:35:07,816 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-08 10:35:08,025 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-08 10:35:08,208 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 10:35:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:10,974 INFO L93 Difference]: Finished difference Result 7729 states and 10794 transitions. [2019-09-08 10:35:10,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:35:10,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-09-08 10:35:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:10,984 INFO L225 Difference]: With dead ends: 7729 [2019-09-08 10:35:10,984 INFO L226 Difference]: Without dead ends: 7723 [2019-09-08 10:35:10,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:35:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7723 states. [2019-09-08 10:35:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7723 to 4031. [2019-09-08 10:35:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-09-08 10:35:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5561 transitions. [2019-09-08 10:35:11,673 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5561 transitions. Word has length 61 [2019-09-08 10:35:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:11,674 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5561 transitions. [2019-09-08 10:35:11,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:35:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5561 transitions. [2019-09-08 10:35:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:35:11,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:11,676 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:35:11,676 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1890999092, now seen corresponding path program 1 times [2019-09-08 10:35:11,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:11,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:12,187 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:35:12,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:12,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:35:12,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:35:12,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:35:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:35:12,189 INFO L87 Difference]: Start difference. First operand 4031 states and 5561 transitions. Second operand 14 states. [2019-09-08 10:35:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:17,529 INFO L93 Difference]: Finished difference Result 14552 states and 20398 transitions. [2019-09-08 10:35:17,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:35:17,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-08 10:35:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:17,547 INFO L225 Difference]: With dead ends: 14552 [2019-09-08 10:35:17,547 INFO L226 Difference]: Without dead ends: 14304 [2019-09-08 10:35:17,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:35:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14304 states. [2019-09-08 10:35:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14304 to 4003. [2019-09-08 10:35:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4003 states. [2019-09-08 10:35:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5529 transitions. [2019-09-08 10:35:18,365 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5529 transitions. Word has length 61 [2019-09-08 10:35:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:18,365 INFO L475 AbstractCegarLoop]: Abstraction has 4003 states and 5529 transitions. [2019-09-08 10:35:18,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:35:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5529 transitions. [2019-09-08 10:35:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:35:18,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:18,367 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] [2019-09-08 10:35:18,367 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash -171028691, now seen corresponding path program 1 times [2019-09-08 10:35:18,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:18,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:18,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:18,739 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:35:18,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:18,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:35:18,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:35:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:35:18,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:35:18,741 INFO L87 Difference]: Start difference. First operand 4003 states and 5529 transitions. Second operand 11 states. [2019-09-08 10:35:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:21,597 INFO L93 Difference]: Finished difference Result 7374 states and 10295 transitions. [2019-09-08 10:35:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 10:35:21,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-09-08 10:35:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:21,605 INFO L225 Difference]: With dead ends: 7374 [2019-09-08 10:35:21,605 INFO L226 Difference]: Without dead ends: 7370 [2019-09-08 10:35:21,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:35:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2019-09-08 10:35:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 3999. [2019-09-08 10:35:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3999 states. [2019-09-08 10:35:22,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5525 transitions. [2019-09-08 10:35:22,360 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5525 transitions. Word has length 62 [2019-09-08 10:35:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:22,361 INFO L475 AbstractCegarLoop]: Abstraction has 3999 states and 5525 transitions. [2019-09-08 10:35:22,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:35:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5525 transitions. [2019-09-08 10:35:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:35:22,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:22,364 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:35:22,364 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1643195361, now seen corresponding path program 1 times [2019-09-08 10:35:22,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:22,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:22,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:22,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:22,438 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:35:22,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:22,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:35:22,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:35:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:35:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:35:22,440 INFO L87 Difference]: Start difference. First operand 3999 states and 5525 transitions. Second operand 6 states. [2019-09-08 10:35:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:25,010 INFO L93 Difference]: Finished difference Result 15382 states and 21659 transitions. [2019-09-08 10:35:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:35:25,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:35:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:25,023 INFO L225 Difference]: With dead ends: 15382 [2019-09-08 10:35:25,024 INFO L226 Difference]: Without dead ends: 12360 [2019-09-08 10:35:25,029 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:35:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12360 states. [2019-09-08 10:35:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12360 to 9909. [2019-09-08 10:35:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9909 states. [2019-09-08 10:35:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9909 states to 9909 states and 13634 transitions. [2019-09-08 10:35:26,956 INFO L78 Accepts]: Start accepts. Automaton has 9909 states and 13634 transitions. Word has length 70 [2019-09-08 10:35:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:26,956 INFO L475 AbstractCegarLoop]: Abstraction has 9909 states and 13634 transitions. [2019-09-08 10:35:26,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:35:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9909 states and 13634 transitions. [2019-09-08 10:35:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:35:26,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:26,961 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:35:26,962 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:26,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2116581710, now seen corresponding path program 1 times [2019-09-08 10:35:26,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:26,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:26,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:26,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:26,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:27,070 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:35:27,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:27,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:35:27,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:35:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:35:27,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:35:27,072 INFO L87 Difference]: Start difference. First operand 9909 states and 13634 transitions. Second operand 5 states. [2019-09-08 10:35:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:28,922 INFO L93 Difference]: Finished difference Result 9915 states and 13637 transitions. [2019-09-08 10:35:28,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:35:28,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:35:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:28,933 INFO L225 Difference]: With dead ends: 9915 [2019-09-08 10:35:28,933 INFO L226 Difference]: Without dead ends: 9093 [2019-09-08 10:35:28,937 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:35:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9093 states. [2019-09-08 10:35:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9093 to 9089. [2019-09-08 10:35:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9089 states. [2019-09-08 10:35:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9089 states to 9089 states and 12533 transitions. [2019-09-08 10:35:30,812 INFO L78 Accepts]: Start accepts. Automaton has 9089 states and 12533 transitions. Word has length 71 [2019-09-08 10:35:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:30,812 INFO L475 AbstractCegarLoop]: Abstraction has 9089 states and 12533 transitions. [2019-09-08 10:35:30,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:35:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9089 states and 12533 transitions. [2019-09-08 10:35:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:35:30,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:30,816 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:35:30,816 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1570673773, now seen corresponding path program 1 times [2019-09-08 10:35:30,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:30,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:30,919 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:35:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:35:30,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:35:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:35:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:35:30,920 INFO L87 Difference]: Start difference. First operand 9089 states and 12533 transitions. Second operand 6 states. [2019-09-08 10:35:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:34,576 INFO L93 Difference]: Finished difference Result 16673 states and 22729 transitions. [2019-09-08 10:35:34,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:35:34,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:35:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:34,595 INFO L225 Difference]: With dead ends: 16673 [2019-09-08 10:35:34,595 INFO L226 Difference]: Without dead ends: 16671 [2019-09-08 10:35:34,600 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:35:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16671 states. [2019-09-08 10:35:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16671 to 9314. [2019-09-08 10:35:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9314 states. [2019-09-08 10:35:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 12683 transitions. [2019-09-08 10:35:37,093 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 12683 transitions. Word has length 72 [2019-09-08 10:35:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:37,093 INFO L475 AbstractCegarLoop]: Abstraction has 9314 states and 12683 transitions. [2019-09-08 10:35:37,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:35:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 12683 transitions. [2019-09-08 10:35:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:35:37,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:37,098 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] [2019-09-08 10:35:37,098 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:37,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:37,099 INFO L82 PathProgramCache]: Analyzing trace with hash -274929820, now seen corresponding path program 1 times [2019-09-08 10:35:37,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:37,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:37,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:37,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:37,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:37,155 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:35:37,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:37,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:37,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:35:37,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:35:37,157 INFO L87 Difference]: Start difference. First operand 9314 states and 12683 transitions. Second operand 3 states. [2019-09-08 10:35:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:40,482 INFO L93 Difference]: Finished difference Result 24510 states and 33505 transitions. [2019-09-08 10:35:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:35:40,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:35:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:40,503 INFO L225 Difference]: With dead ends: 24510 [2019-09-08 10:35:40,503 INFO L226 Difference]: Without dead ends: 15996 [2019-09-08 10:35:40,517 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:35:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15996 states. [2019-09-08 10:35:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15996 to 15799. [2019-09-08 10:35:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15799 states. [2019-09-08 10:35:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15799 states to 15799 states and 21244 transitions. [2019-09-08 10:35:43,844 INFO L78 Accepts]: Start accepts. Automaton has 15799 states and 21244 transitions. Word has length 73 [2019-09-08 10:35:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:43,844 INFO L475 AbstractCegarLoop]: Abstraction has 15799 states and 21244 transitions. [2019-09-08 10:35:43,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:35:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 15799 states and 21244 transitions. [2019-09-08 10:35:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:35:43,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:43,851 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:35:43,851 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash 61383844, now seen corresponding path program 1 times [2019-09-08 10:35:43,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:43,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:43,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:43,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:43,903 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:35:43,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:43,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:35:43,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:35:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:35:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:35:43,905 INFO L87 Difference]: Start difference. First operand 15799 states and 21244 transitions. Second operand 5 states. [2019-09-08 10:35:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:54,591 INFO L93 Difference]: Finished difference Result 61058 states and 82233 transitions. [2019-09-08 10:35:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:35:54,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 10:35:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:54,639 INFO L225 Difference]: With dead ends: 61058 [2019-09-08 10:35:54,639 INFO L226 Difference]: Without dead ends: 46167 [2019-09-08 10:35:54,659 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:35:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46167 states. [2019-09-08 10:35:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46167 to 24454. [2019-09-08 10:35:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24454 states. [2019-09-08 10:35:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24454 states to 24454 states and 32517 transitions. [2019-09-08 10:35:59,931 INFO L78 Accepts]: Start accepts. Automaton has 24454 states and 32517 transitions. Word has length 74 [2019-09-08 10:35:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:59,931 INFO L475 AbstractCegarLoop]: Abstraction has 24454 states and 32517 transitions. [2019-09-08 10:35:59,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:35:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 24454 states and 32517 transitions. [2019-09-08 10:35:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:35:59,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:59,937 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:35:59,938 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1329668181, now seen corresponding path program 1 times [2019-09-08 10:35:59,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:59,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:59,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:59,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:59,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:59,998 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:35:59,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:59,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:35:59,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:35:59,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:00,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:00,000 INFO L87 Difference]: Start difference. First operand 24454 states and 32517 transitions. Second operand 3 states. [2019-09-08 10:36:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:10,603 INFO L93 Difference]: Finished difference Result 69326 states and 91957 transitions. [2019-09-08 10:36:10,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:10,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:36:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:10,657 INFO L225 Difference]: With dead ends: 69326 [2019-09-08 10:36:10,657 INFO L226 Difference]: Without dead ends: 45863 [2019-09-08 10:36:10,679 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:36:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45863 states. [2019-09-08 10:36:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45863 to 43004. [2019-09-08 10:36:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43004 states. [2019-09-08 10:36:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43004 states to 43004 states and 56655 transitions. [2019-09-08 10:36:19,960 INFO L78 Accepts]: Start accepts. Automaton has 43004 states and 56655 transitions. Word has length 74 [2019-09-08 10:36:19,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:19,960 INFO L475 AbstractCegarLoop]: Abstraction has 43004 states and 56655 transitions. [2019-09-08 10:36:19,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 43004 states and 56655 transitions. [2019-09-08 10:36:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:36:19,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:19,965 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] [2019-09-08 10:36:19,965 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:19,966 INFO L82 PathProgramCache]: Analyzing trace with hash -790939587, now seen corresponding path program 1 times [2019-09-08 10:36:19,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:19,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:19,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:19,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:19,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:20,011 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:20,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:20,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:20,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:20,013 INFO L87 Difference]: Start difference. First operand 43004 states and 56655 transitions. Second operand 3 states. [2019-09-08 10:36:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:30,186 INFO L93 Difference]: Finished difference Result 85839 states and 112592 transitions. [2019-09-08 10:36:30,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:30,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:36:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:30,245 INFO L225 Difference]: With dead ends: 85839 [2019-09-08 10:36:30,245 INFO L226 Difference]: Without dead ends: 43572 [2019-09-08 10:36:30,286 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:36:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43572 states. [2019-09-08 10:36:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43572 to 43030. [2019-09-08 10:36:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43030 states. [2019-09-08 10:36:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43030 states to 43030 states and 55523 transitions. [2019-09-08 10:36:39,680 INFO L78 Accepts]: Start accepts. Automaton has 43030 states and 55523 transitions. Word has length 75 [2019-09-08 10:36:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:39,680 INFO L475 AbstractCegarLoop]: Abstraction has 43030 states and 55523 transitions. [2019-09-08 10:36:39,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:36:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 43030 states and 55523 transitions. [2019-09-08 10:36:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 10:36:39,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:39,689 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 1] [2019-09-08 10:36:39,690 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash -424988470, now seen corresponding path program 1 times [2019-09-08 10:36:39,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:39,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:39,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:36:39,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:39,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:36:39,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:36:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:36:39,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:36:39,762 INFO L87 Difference]: Start difference. First operand 43030 states and 55523 transitions. Second operand 3 states. [2019-09-08 10:36:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:58,497 INFO L93 Difference]: Finished difference Result 122530 states and 157581 transitions. [2019-09-08 10:36:58,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:36:58,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 10:36:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:58,593 INFO L225 Difference]: With dead ends: 122530 [2019-09-08 10:36:58,594 INFO L226 Difference]: Without dead ends: 80237 [2019-09-08 10:36:58,627 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:36:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80237 states. [2019-09-08 10:37:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80237 to 69047. [2019-09-08 10:37:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69047 states. [2019-09-08 10:37:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69047 states to 69047 states and 88056 transitions. [2019-09-08 10:37:16,146 INFO L78 Accepts]: Start accepts. Automaton has 69047 states and 88056 transitions. Word has length 93 [2019-09-08 10:37:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:37:16,147 INFO L475 AbstractCegarLoop]: Abstraction has 69047 states and 88056 transitions. [2019-09-08 10:37:16,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:37:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69047 states and 88056 transitions. [2019-09-08 10:37:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 10:37:16,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:37:16,158 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:37:16,158 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:37:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:37:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash 551342129, now seen corresponding path program 1 times [2019-09-08 10:37:16,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:37:16,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:37:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:37:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:37:16,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:37:16,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:37:16,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:37:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:37:16,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 10:37:16,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:37:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:37:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:37:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:37:16,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-08 10:37:17,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 10:37:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 10:37:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:37:17,000 INFO L87 Difference]: Start difference. First operand 69047 states and 88056 transitions. Second operand 18 states. [2019-09-08 10:38:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:38:17,548 INFO L93 Difference]: Finished difference Result 261700 states and 331490 transitions. [2019-09-08 10:38:17,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-08 10:38:17,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-09-08 10:38:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:38:18,159 INFO L225 Difference]: With dead ends: 261700 [2019-09-08 10:38:18,160 INFO L226 Difference]: Without dead ends: 220964 [2019-09-08 10:38:18,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=951, Invalid=2831, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 10:38:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220964 states. [2019-09-08 10:38:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220964 to 99384. [2019-09-08 10:38:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99384 states. [2019-09-08 10:38:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99384 states to 99384 states and 126828 transitions. [2019-09-08 10:38:48,353 INFO L78 Accepts]: Start accepts. Automaton has 99384 states and 126828 transitions. Word has length 96 [2019-09-08 10:38:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:48,353 INFO L475 AbstractCegarLoop]: Abstraction has 99384 states and 126828 transitions. [2019-09-08 10:38:48,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 10:38:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 99384 states and 126828 transitions. [2019-09-08 10:38:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 10:38:48,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:48,378 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:38:48,378 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash -777403506, now seen corresponding path program 1 times [2019-09-08 10:38:48,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:48,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:48,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 10:38:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:48,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:38:48,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:38:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:38:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:38:48,518 INFO L87 Difference]: Start difference. First operand 99384 states and 126828 transitions. Second operand 9 states. [2019-09-08 10:40:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:17,380 INFO L93 Difference]: Finished difference Result 380319 states and 486385 transitions. [2019-09-08 10:40:17,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:40:17,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 10:40:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:17,978 INFO L225 Difference]: With dead ends: 380319 [2019-09-08 10:40:17,978 INFO L226 Difference]: Without dead ends: 337099 [2019-09-08 10:40:18,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:40:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337099 states. [2019-09-08 10:40:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337099 to 99318. [2019-09-08 10:40:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99318 states. [2019-09-08 10:40:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99318 states to 99318 states and 126754 transitions. [2019-09-08 10:40:49,369 INFO L78 Accepts]: Start accepts. Automaton has 99318 states and 126754 transitions. Word has length 96 [2019-09-08 10:40:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:49,369 INFO L475 AbstractCegarLoop]: Abstraction has 99318 states and 126754 transitions. [2019-09-08 10:40:49,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:40:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 99318 states and 126754 transitions. [2019-09-08 10:40:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:40:49,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:49,379 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:49,379 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash -370268567, now seen corresponding path program 1 times [2019-09-08 10:40:49,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:49,594 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:40:49,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:49,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:40:49,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:40:49,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:40:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:40:49,596 INFO L87 Difference]: Start difference. First operand 99318 states and 126754 transitions. Second operand 10 states. [2019-09-08 10:42:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:24,677 INFO L93 Difference]: Finished difference Result 378770 states and 480261 transitions. [2019-09-08 10:42:24,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:42:24,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 10:42:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:25,331 INFO L225 Difference]: With dead ends: 378770 [2019-09-08 10:42:25,332 INFO L226 Difference]: Without dead ends: 320857 [2019-09-08 10:42:25,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 10:42:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320857 states. [2019-09-08 10:43:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320857 to 132004. [2019-09-08 10:43:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132004 states. [2019-09-08 10:43:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132004 states to 132004 states and 168342 transitions. [2019-09-08 10:43:07,578 INFO L78 Accepts]: Start accepts. Automaton has 132004 states and 168342 transitions. Word has length 97 [2019-09-08 10:43:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:07,579 INFO L475 AbstractCegarLoop]: Abstraction has 132004 states and 168342 transitions. [2019-09-08 10:43:07,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:43:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 132004 states and 168342 transitions. [2019-09-08 10:43:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:43:07,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:07,592 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:07,592 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash -316974870, now seen corresponding path program 1 times [2019-09-08 10:43:07,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:07,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:07,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:43:07,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:07,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:43:07,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:43:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:43:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:43:07,657 INFO L87 Difference]: Start difference. First operand 132004 states and 168342 transitions. Second operand 3 states. [2019-09-08 10:43:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:44,182 INFO L93 Difference]: Finished difference Result 250928 states and 320364 transitions. [2019-09-08 10:43:44,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:43:44,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 10:43:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:44,378 INFO L225 Difference]: With dead ends: 250928 [2019-09-08 10:43:44,378 INFO L226 Difference]: Without dead ends: 119595 [2019-09-08 10:43:44,513 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:43:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119595 states. [2019-09-08 10:44:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119595 to 119595. [2019-09-08 10:44:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119595 states. [2019-09-08 10:44:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119595 states to 119595 states and 151475 transitions. [2019-09-08 10:44:17,266 INFO L78 Accepts]: Start accepts. Automaton has 119595 states and 151475 transitions. Word has length 97 [2019-09-08 10:44:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:17,266 INFO L475 AbstractCegarLoop]: Abstraction has 119595 states and 151475 transitions. [2019-09-08 10:44:17,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 119595 states and 151475 transitions. [2019-09-08 10:44:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:44:17,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:17,275 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1] [2019-09-08 10:44:17,276 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash 850756577, now seen corresponding path program 1 times [2019-09-08 10:44:17,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:17,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:17,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:17,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:17,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:17,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:17,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:17,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:17,340 INFO L87 Difference]: Start difference. First operand 119595 states and 151475 transitions. Second operand 3 states. [2019-09-08 10:44:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:50,737 INFO L93 Difference]: Finished difference Result 238513 states and 302200 transitions. [2019-09-08 10:44:50,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:50,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 10:44:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:50,919 INFO L225 Difference]: With dead ends: 238513 [2019-09-08 10:44:50,919 INFO L226 Difference]: Without dead ends: 119597 [2019-09-08 10:44:51,036 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:44:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119597 states. [2019-09-08 10:45:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119597 to 117513. [2019-09-08 10:45:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117513 states. [2019-09-08 10:45:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117513 states to 117513 states and 146611 transitions. [2019-09-08 10:45:26,542 INFO L78 Accepts]: Start accepts. Automaton has 117513 states and 146611 transitions. Word has length 97 [2019-09-08 10:45:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:26,542 INFO L475 AbstractCegarLoop]: Abstraction has 117513 states and 146611 transitions. [2019-09-08 10:45:26,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 117513 states and 146611 transitions. [2019-09-08 10:45:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:45:26,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:26,551 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:26,551 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1983209285, now seen corresponding path program 1 times [2019-09-08 10:45:26,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 10:45:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:26,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:45:26,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:45:26,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:45:26,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:45:26,692 INFO L87 Difference]: Start difference. First operand 117513 states and 146611 transitions. Second operand 9 states. [2019-09-08 10:45:27,106 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-08 10:47:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:04,721 INFO L93 Difference]: Finished difference Result 412937 states and 514521 transitions. [2019-09-08 10:47:04,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:47:04,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 10:47:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:05,192 INFO L225 Difference]: With dead ends: 412937 [2019-09-08 10:47:05,192 INFO L226 Difference]: Without dead ends: 334357 [2019-09-08 10:47:05,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:47:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334357 states. [2019-09-08 10:47:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334357 to 117463. [2019-09-08 10:47:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117463 states. [2019-09-08 10:47:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117463 states to 117463 states and 146552 transitions. [2019-09-08 10:47:39,560 INFO L78 Accepts]: Start accepts. Automaton has 117463 states and 146552 transitions. Word has length 97 [2019-09-08 10:47:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:39,560 INFO L475 AbstractCegarLoop]: Abstraction has 117463 states and 146552 transitions. [2019-09-08 10:47:39,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:47:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 117463 states and 146552 transitions. [2019-09-08 10:47:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:47:39,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:39,569 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:39,569 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash 143013179, now seen corresponding path program 1 times [2019-09-08 10:47:39,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:39,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:39,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:47:39,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:47:39,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:39,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:47:39,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:47:40,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:47:40,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:47:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:40,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:47:40,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-09-08 10:47:40,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 10:47:40,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 10:47:40,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:47:40,849 INFO L87 Difference]: Start difference. First operand 117463 states and 146552 transitions. Second operand 18 states. [2019-09-08 10:47:41,106 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 10:47:41,397 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48