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.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:57:51,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:57:51,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:57:51,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:57:51,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:57:51,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:57:51,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:57:51,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:57:51,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:57:51,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:57:51,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:57:51,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:57:51,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:57:51,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:57:51,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:57:51,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:57:51,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:57:51,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:57:51,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:57:51,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:57:51,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:57:51,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:57:51,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:57:51,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:57:51,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:57:51,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:57:51,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:57:51,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:57:51,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:57:51,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:57:51,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:57:51,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:57:51,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:57:51,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:57:51,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:57:51,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:57:51,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:57:51,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:57:51,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:57:51,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:57:51,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:57:51,256 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 11:57:51,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:57:51,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:57:51,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:57:51,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:57:51,284 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:57:51,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:57:51,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:57:51,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:57:51,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:57:51,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:57:51,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:57:51,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:57:51,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:57:51,287 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:57:51,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:57:51,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:57:51,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:57:51,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:57:51,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:57:51,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:57:51,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:57:51,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:57:51,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:57:51,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:57:51,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:57:51,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:57:51,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:57:51,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:57:51,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:57:51,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:57:51,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:57:51,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:57:51,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:57:51,356 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:57:51,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:57:51,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f45b90f/2875df8ed0684619ae4a6c20c181e27c/FLAGe2205aed0 [2019-09-08 11:57:51,976 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:57:51,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:57:51,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f45b90f/2875df8ed0684619ae4a6c20c181e27c/FLAGe2205aed0 [2019-09-08 11:57:52,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f45b90f/2875df8ed0684619ae4a6c20c181e27c [2019-09-08 11:57:52,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:57:52,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:57:52,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:57:52,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:57:52,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:57:52,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:52,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293ccab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52, skipping insertion in model container [2019-09-08 11:57:52,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:52,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:57:52,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:57:52,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:57:52,784 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:57:52,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:57:52,973 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:57:52,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52 WrapperNode [2019-09-08 11:57:52,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:57:52,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:57:52,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:57:52,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:57:52,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:52,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:53,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:53,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:53,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:53,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:53,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (1/1) ... [2019-09-08 11:57:53,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:57:53,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:57:53,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:57:53,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:57:53,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (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 11:57:53,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:57:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:57:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:57:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:57:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:57:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:57:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:57:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:57:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:57:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:57:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:57:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:57:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:57:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:57:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:57:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:57:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:57:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:57:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:57:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:57:54,317 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:57:54,318 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:57:54,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:57:54 BoogieIcfgContainer [2019-09-08 11:57:54,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:57:54,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:57:54,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:57:54,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:57:54,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:57:52" (1/3) ... [2019-09-08 11:57:54,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dfe4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:57:54, skipping insertion in model container [2019-09-08 11:57:54,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:57:52" (2/3) ... [2019-09-08 11:57:54,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dfe4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:57:54, skipping insertion in model container [2019-09-08 11:57:54,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:57:54" (3/3) ... [2019-09-08 11:57:54,334 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2019-09-08 11:57:54,345 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:57:54,368 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:57:54,389 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:57:54,436 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:57:54,437 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:57:54,437 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:57:54,437 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:57:54,438 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:57:54,438 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:57:54,438 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:57:54,438 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:57:54,438 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:57:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2019-09-08 11:57:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:57:54,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:54,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:57:54,493 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1992210695, now seen corresponding path program 1 times [2019-09-08 11:57:54,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:54,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:54,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:54,898 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 11:57:54,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:54,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:57:54,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:57:54,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:57:54,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:57:54,923 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 4 states. [2019-09-08 11:57:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:55,093 INFO L93 Difference]: Finished difference Result 407 states and 660 transitions. [2019-09-08 11:57:55,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:57:55,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-08 11:57:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:55,109 INFO L225 Difference]: With dead ends: 407 [2019-09-08 11:57:55,110 INFO L226 Difference]: Without dead ends: 216 [2019-09-08 11:57:55,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-08 11:57:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-08 11:57:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-08 11:57:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 321 transitions. [2019-09-08 11:57:55,180 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 321 transitions. Word has length 83 [2019-09-08 11:57:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:55,180 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 321 transitions. [2019-09-08 11:57:55,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:57:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 321 transitions. [2019-09-08 11:57:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 11:57:55,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:55,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:55,187 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1513227412, now seen corresponding path program 1 times [2019-09-08 11:57:55,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:55,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:55,398 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 11:57:55,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:55,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:55,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:55,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:55,402 INFO L87 Difference]: Start difference. First operand 216 states and 321 transitions. Second operand 3 states. [2019-09-08 11:57:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:55,474 INFO L93 Difference]: Finished difference Result 484 states and 747 transitions. [2019-09-08 11:57:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:55,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-08 11:57:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:55,479 INFO L225 Difference]: With dead ends: 484 [2019-09-08 11:57:55,480 INFO L226 Difference]: Without dead ends: 313 [2019-09-08 11:57:55,484 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 11:57:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-08 11:57:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2019-09-08 11:57:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-08 11:57:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 471 transitions. [2019-09-08 11:57:55,517 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 471 transitions. Word has length 113 [2019-09-08 11:57:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:55,518 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 471 transitions. [2019-09-08 11:57:55,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 471 transitions. [2019-09-08 11:57:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 11:57:55,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:55,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:55,523 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:55,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:55,523 INFO L82 PathProgramCache]: Analyzing trace with hash -397003732, now seen corresponding path program 1 times [2019-09-08 11:57:55,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:55,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:55,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:55,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:55,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:55,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:55,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:55,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:55,704 INFO L87 Difference]: Start difference. First operand 311 states and 471 transitions. Second operand 3 states. [2019-09-08 11:57:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:55,785 INFO L93 Difference]: Finished difference Result 739 states and 1152 transitions. [2019-09-08 11:57:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:55,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 11:57:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:55,789 INFO L225 Difference]: With dead ends: 739 [2019-09-08 11:57:55,789 INFO L226 Difference]: Without dead ends: 479 [2019-09-08 11:57:55,791 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 11:57:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-08 11:57:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2019-09-08 11:57:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-08 11:57:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 733 transitions. [2019-09-08 11:57:55,826 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 733 transitions. Word has length 115 [2019-09-08 11:57:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:55,829 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 733 transitions. [2019-09-08 11:57:55,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 733 transitions. [2019-09-08 11:57:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 11:57:55,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:55,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:55,839 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1397368894, now seen corresponding path program 1 times [2019-09-08 11:57:55,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:55,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:55,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:55,948 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 11:57:55,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:55,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:55,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:55,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:55,951 INFO L87 Difference]: Start difference. First operand 477 states and 733 transitions. Second operand 3 states. [2019-09-08 11:57:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:56,009 INFO L93 Difference]: Finished difference Result 1179 states and 1848 transitions. [2019-09-08 11:57:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:56,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 11:57:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:56,015 INFO L225 Difference]: With dead ends: 1179 [2019-09-08 11:57:56,015 INFO L226 Difference]: Without dead ends: 759 [2019-09-08 11:57:56,016 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 11:57:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-08 11:57:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2019-09-08 11:57:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-09-08 11:57:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1173 transitions. [2019-09-08 11:57:56,055 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1173 transitions. Word has length 117 [2019-09-08 11:57:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:56,055 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 1173 transitions. [2019-09-08 11:57:56,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1173 transitions. [2019-09-08 11:57:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 11:57:56,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:56,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:56,060 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2031984001, now seen corresponding path program 1 times [2019-09-08 11:57:56,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:56,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:56,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:56,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:56,146 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 11:57:56,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:56,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:56,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:56,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:56,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:56,149 INFO L87 Difference]: Start difference. First operand 757 states and 1173 transitions. Second operand 3 states. [2019-09-08 11:57:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:56,224 INFO L93 Difference]: Finished difference Result 1905 states and 2988 transitions. [2019-09-08 11:57:56,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:56,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-08 11:57:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:56,235 INFO L225 Difference]: With dead ends: 1905 [2019-09-08 11:57:56,235 INFO L226 Difference]: Without dead ends: 1211 [2019-09-08 11:57:56,237 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 11:57:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-08 11:57:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2019-09-08 11:57:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-09-08 11:57:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1877 transitions. [2019-09-08 11:57:56,297 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1877 transitions. Word has length 119 [2019-09-08 11:57:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:56,298 INFO L475 AbstractCegarLoop]: Abstraction has 1209 states and 1877 transitions. [2019-09-08 11:57:56,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1877 transitions. [2019-09-08 11:57:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 11:57:56,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:56,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:56,303 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1164316389, now seen corresponding path program 1 times [2019-09-08 11:57:56,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:56,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:56,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:56,452 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 11:57:56,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:56,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:56,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:56,454 INFO L87 Difference]: Start difference. First operand 1209 states and 1877 transitions. Second operand 3 states. [2019-09-08 11:57:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:56,558 INFO L93 Difference]: Finished difference Result 3035 states and 4740 transitions. [2019-09-08 11:57:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:56,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 11:57:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:56,571 INFO L225 Difference]: With dead ends: 3035 [2019-09-08 11:57:56,571 INFO L226 Difference]: Without dead ends: 1895 [2019-09-08 11:57:56,576 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 11:57:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-09-08 11:57:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2019-09-08 11:57:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-09-08 11:57:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2925 transitions. [2019-09-08 11:57:56,669 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2925 transitions. Word has length 121 [2019-09-08 11:57:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:56,669 INFO L475 AbstractCegarLoop]: Abstraction has 1893 states and 2925 transitions. [2019-09-08 11:57:56,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2925 transitions. [2019-09-08 11:57:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:57:56,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:56,677 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:56,677 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1584689036, now seen corresponding path program 1 times [2019-09-08 11:57:56,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:56,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:56,804 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 11:57:56,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:56,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:56,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:56,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:56,808 INFO L87 Difference]: Start difference. First operand 1893 states and 2925 transitions. Second operand 3 states. [2019-09-08 11:57:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:57,263 INFO L93 Difference]: Finished difference Result 5221 states and 8086 transitions. [2019-09-08 11:57:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:57,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 11:57:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:57,285 INFO L225 Difference]: With dead ends: 5221 [2019-09-08 11:57:57,285 INFO L226 Difference]: Without dead ends: 3711 [2019-09-08 11:57:57,291 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 11:57:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-09-08 11:57:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3709. [2019-09-08 11:57:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3709 states. [2019-09-08 11:57:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5728 transitions. [2019-09-08 11:57:57,468 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5728 transitions. Word has length 123 [2019-09-08 11:57:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:57,470 INFO L475 AbstractCegarLoop]: Abstraction has 3709 states and 5728 transitions. [2019-09-08 11:57:57,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5728 transitions. [2019-09-08 11:57:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:57:57,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:57,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:57,481 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:57,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:57,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1263248665, now seen corresponding path program 1 times [2019-09-08 11:57:57,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:57,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:57,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:57,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:57,581 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 11:57:57,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:57,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:57,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:57,584 INFO L87 Difference]: Start difference. First operand 3709 states and 5728 transitions. Second operand 3 states. [2019-09-08 11:57:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:58,271 INFO L93 Difference]: Finished difference Result 10109 states and 15572 transitions. [2019-09-08 11:57:58,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:58,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 11:57:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:58,319 INFO L225 Difference]: With dead ends: 10109 [2019-09-08 11:57:58,320 INFO L226 Difference]: Without dead ends: 7275 [2019-09-08 11:57:58,327 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 11:57:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-08 11:57:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 7273. [2019-09-08 11:57:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-08 11:57:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 11170 transitions. [2019-09-08 11:57:58,721 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 11170 transitions. Word has length 123 [2019-09-08 11:57:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:58,721 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 11170 transitions. [2019-09-08 11:57:58,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 11170 transitions. [2019-09-08 11:57:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:57:58,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:58,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:57:58,741 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:58,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1757850626, now seen corresponding path program 1 times [2019-09-08 11:57:58,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:58,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:58,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:58,926 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 11:57:58,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:58,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:57:58,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:57:58,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:57:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:57:58,927 INFO L87 Difference]: Start difference. First operand 7273 states and 11170 transitions. Second operand 5 states. [2019-09-08 11:57:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:59,622 INFO L93 Difference]: Finished difference Result 14497 states and 22287 transitions. [2019-09-08 11:57:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:57:59,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-08 11:57:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:59,666 INFO L225 Difference]: With dead ends: 14497 [2019-09-08 11:57:59,666 INFO L226 Difference]: Without dead ends: 7273 [2019-09-08 11:57:59,684 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 11:57:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2019-09-08 11:58:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 7273. [2019-09-08 11:58:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-08 11:58:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 11097 transitions. [2019-09-08 11:58:00,183 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 11097 transitions. Word has length 123 [2019-09-08 11:58:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:00,184 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 11097 transitions. [2019-09-08 11:58:00,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 11097 transitions. [2019-09-08 11:58:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:58:00,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:00,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:00,203 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2108867320, now seen corresponding path program 1 times [2019-09-08 11:58:00,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:00,318 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 11:58:00,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:00,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:00,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:00,320 INFO L87 Difference]: Start difference. First operand 7273 states and 11097 transitions. Second operand 5 states. [2019-09-08 11:58:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:00,973 INFO L93 Difference]: Finished difference Result 14479 states and 22118 transitions. [2019-09-08 11:58:00,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:00,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-08 11:58:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:01,014 INFO L225 Difference]: With dead ends: 14479 [2019-09-08 11:58:01,018 INFO L226 Difference]: Without dead ends: 7273 [2019-09-08 11:58:01,032 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 11:58:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2019-09-08 11:58:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 7273. [2019-09-08 11:58:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-08 11:58:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 10999 transitions. [2019-09-08 11:58:01,391 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 10999 transitions. Word has length 123 [2019-09-08 11:58:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:01,392 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 10999 transitions. [2019-09-08 11:58:01,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 10999 transitions. [2019-09-08 11:58:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:58:01,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:01,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:01,412 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash 561649966, now seen corresponding path program 1 times [2019-09-08 11:58:01,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:01,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:01,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:01,554 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 11:58:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:01,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:01,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:01,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:01,556 INFO L87 Difference]: Start difference. First operand 7273 states and 10999 transitions. Second operand 5 states. [2019-09-08 11:58:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:02,041 INFO L93 Difference]: Finished difference Result 10043 states and 15176 transitions. [2019-09-08 11:58:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:02,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-08 11:58:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:02,051 INFO L225 Difference]: With dead ends: 10043 [2019-09-08 11:58:02,052 INFO L226 Difference]: Without dead ends: 3709 [2019-09-08 11:58:02,065 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 11:58:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2019-09-08 11:58:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2019-09-08 11:58:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3709 states. [2019-09-08 11:58:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5575 transitions. [2019-09-08 11:58:02,257 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5575 transitions. Word has length 123 [2019-09-08 11:58:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:02,257 INFO L475 AbstractCegarLoop]: Abstraction has 3709 states and 5575 transitions. [2019-09-08 11:58:02,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5575 transitions. [2019-09-08 11:58:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:58:02,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:02,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:02,269 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1342752456, now seen corresponding path program 1 times [2019-09-08 11:58:02,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:02,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:02,381 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 11:58:02,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:02,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:02,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:02,384 INFO L87 Difference]: Start difference. First operand 3709 states and 5575 transitions. Second operand 5 states. [2019-09-08 11:58:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:02,659 INFO L93 Difference]: Finished difference Result 5211 states and 7840 transitions. [2019-09-08 11:58:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:02,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-08 11:58:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:02,665 INFO L225 Difference]: With dead ends: 5211 [2019-09-08 11:58:02,665 INFO L226 Difference]: Without dead ends: 1893 [2019-09-08 11:58:02,672 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 11:58:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-09-08 11:58:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1893. [2019-09-08 11:58:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-09-08 11:58:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2827 transitions. [2019-09-08 11:58:02,877 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2827 transitions. Word has length 123 [2019-09-08 11:58:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:02,877 INFO L475 AbstractCegarLoop]: Abstraction has 1893 states and 2827 transitions. [2019-09-08 11:58:02,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2827 transitions. [2019-09-08 11:58:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:58:02,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:02,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:02,884 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1836799170, now seen corresponding path program 1 times [2019-09-08 11:58:02,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:02,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:02,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:02,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:03,106 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 11:58:03,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:03,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:03,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:03,110 INFO L87 Difference]: Start difference. First operand 1893 states and 2827 transitions. Second operand 7 states. [2019-09-08 11:58:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:04,101 INFO L93 Difference]: Finished difference Result 13750 states and 20565 transitions. [2019-09-08 11:58:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:58:04,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-09-08 11:58:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:04,132 INFO L225 Difference]: With dead ends: 13750 [2019-09-08 11:58:04,132 INFO L226 Difference]: Without dead ends: 11932 [2019-09-08 11:58:04,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11932 states. [2019-09-08 11:58:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11932 to 5199. [2019-09-08 11:58:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5199 states. [2019-09-08 11:58:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 7669 transitions. [2019-09-08 11:58:04,897 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 7669 transitions. Word has length 123 [2019-09-08 11:58:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:04,898 INFO L475 AbstractCegarLoop]: Abstraction has 5199 states and 7669 transitions. [2019-09-08 11:58:04,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7669 transitions. [2019-09-08 11:58:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:58:04,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:04,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:04,913 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash 676747649, now seen corresponding path program 1 times [2019-09-08 11:58:04,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:04,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:04,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:04,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:04,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:05,000 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 11:58:05,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:05,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:58:05,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:58:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:58:05,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:58:05,002 INFO L87 Difference]: Start difference. First operand 5199 states and 7669 transitions. Second operand 3 states. [2019-09-08 11:58:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:05,288 INFO L93 Difference]: Finished difference Result 8947 states and 13175 transitions. [2019-09-08 11:58:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:58:05,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 11:58:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:05,299 INFO L225 Difference]: With dead ends: 8947 [2019-09-08 11:58:05,299 INFO L226 Difference]: Without dead ends: 4589 [2019-09-08 11:58:05,309 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 11:58:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2019-09-08 11:58:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4587. [2019-09-08 11:58:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2019-09-08 11:58:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6700 transitions. [2019-09-08 11:58:05,648 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6700 transitions. Word has length 127 [2019-09-08 11:58:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:05,649 INFO L475 AbstractCegarLoop]: Abstraction has 4587 states and 6700 transitions. [2019-09-08 11:58:05,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:58:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6700 transitions. [2019-09-08 11:58:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:58:05,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:05,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:05,658 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1123021911, now seen corresponding path program 1 times [2019-09-08 11:58:05,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:05,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:05,948 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 11:58:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:05,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:05,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:05,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:05,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:05,950 INFO L87 Difference]: Start difference. First operand 4587 states and 6700 transitions. Second operand 7 states. [2019-09-08 11:58:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:06,600 INFO L93 Difference]: Finished difference Result 10488 states and 15369 transitions. [2019-09-08 11:58:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:06,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2019-09-08 11:58:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:06,615 INFO L225 Difference]: With dead ends: 10488 [2019-09-08 11:58:06,615 INFO L226 Difference]: Without dead ends: 5976 [2019-09-08 11:58:06,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:58:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2019-09-08 11:58:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 4587. [2019-09-08 11:58:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2019-09-08 11:58:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6651 transitions. [2019-09-08 11:58:07,010 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6651 transitions. Word has length 127 [2019-09-08 11:58:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:07,010 INFO L475 AbstractCegarLoop]: Abstraction has 4587 states and 6651 transitions. [2019-09-08 11:58:07,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6651 transitions. [2019-09-08 11:58:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:58:07,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:07,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:07,018 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1782507606, now seen corresponding path program 1 times [2019-09-08 11:58:07,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:07,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:07,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:07,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:07,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:07,164 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 11:58:07,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:07,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:58:07,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:58:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:58:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:58:07,165 INFO L87 Difference]: Start difference. First operand 4587 states and 6651 transitions. Second operand 3 states. [2019-09-08 11:58:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:07,594 INFO L93 Difference]: Finished difference Result 10880 states and 15770 transitions. [2019-09-08 11:58:07,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:58:07,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 11:58:07,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:07,609 INFO L225 Difference]: With dead ends: 10880 [2019-09-08 11:58:07,609 INFO L226 Difference]: Without dead ends: 6366 [2019-09-08 11:58:07,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 11:58:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2019-09-08 11:58:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 6364. [2019-09-08 11:58:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6364 states. [2019-09-08 11:58:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 9077 transitions. [2019-09-08 11:58:08,080 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 9077 transitions. Word has length 127 [2019-09-08 11:58:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:08,080 INFO L475 AbstractCegarLoop]: Abstraction has 6364 states and 9077 transitions. [2019-09-08 11:58:08,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:58:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 9077 transitions. [2019-09-08 11:58:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:58:08,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:08,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:08,089 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1836626465, now seen corresponding path program 1 times [2019-09-08 11:58:08,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:08,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:08,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:08,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:08,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:08,208 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 11:58:08,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:08,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:08,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:08,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:08,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:08,210 INFO L87 Difference]: Start difference. First operand 6364 states and 9077 transitions. Second operand 5 states. [2019-09-08 11:58:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:09,310 INFO L93 Difference]: Finished difference Result 19472 states and 27857 transitions. [2019-09-08 11:58:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:09,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-08 11:58:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:09,352 INFO L225 Difference]: With dead ends: 19472 [2019-09-08 11:58:09,352 INFO L226 Difference]: Without dead ends: 13902 [2019-09-08 11:58:09,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:58:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13902 states. [2019-09-08 11:58:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13902 to 12014. [2019-09-08 11:58:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12014 states. [2019-09-08 11:58:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12014 states to 12014 states and 17190 transitions. [2019-09-08 11:58:10,500 INFO L78 Accepts]: Start accepts. Automaton has 12014 states and 17190 transitions. Word has length 128 [2019-09-08 11:58:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:10,501 INFO L475 AbstractCegarLoop]: Abstraction has 12014 states and 17190 transitions. [2019-09-08 11:58:10,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 12014 states and 17190 transitions. [2019-09-08 11:58:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:58:10,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:10,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:10,514 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -613499603, now seen corresponding path program 1 times [2019-09-08 11:58:10,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:10,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:10,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:10,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:10,697 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 11:58:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:10,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:10,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:10,699 INFO L87 Difference]: Start difference. First operand 12014 states and 17190 transitions. Second operand 7 states. [2019-09-08 11:58:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:12,226 INFO L93 Difference]: Finished difference Result 36471 states and 52165 transitions. [2019-09-08 11:58:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:12,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-08 11:58:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:12,271 INFO L225 Difference]: With dead ends: 36471 [2019-09-08 11:58:12,271 INFO L226 Difference]: Without dead ends: 25365 [2019-09-08 11:58:12,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25365 states. [2019-09-08 11:58:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25365 to 15800. [2019-09-08 11:58:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15800 states. [2019-09-08 11:58:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15800 states to 15800 states and 22499 transitions. [2019-09-08 11:58:14,009 INFO L78 Accepts]: Start accepts. Automaton has 15800 states and 22499 transitions. Word has length 128 [2019-09-08 11:58:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:14,009 INFO L475 AbstractCegarLoop]: Abstraction has 15800 states and 22499 transitions. [2019-09-08 11:58:14,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 15800 states and 22499 transitions. [2019-09-08 11:58:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:58:14,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:14,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:14,021 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash -331054105, now seen corresponding path program 1 times [2019-09-08 11:58:14,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:14,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:14,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:14,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:14,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:14,179 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 11:58:14,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:14,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:14,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:14,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:14,181 INFO L87 Difference]: Start difference. First operand 15800 states and 22499 transitions. Second operand 7 states. [2019-09-08 11:58:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:15,918 INFO L93 Difference]: Finished difference Result 40213 states and 57419 transitions. [2019-09-08 11:58:15,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:15,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-08 11:58:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:15,970 INFO L225 Difference]: With dead ends: 40213 [2019-09-08 11:58:15,970 INFO L226 Difference]: Without dead ends: 29107 [2019-09-08 11:58:15,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29107 states. [2019-09-08 11:58:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29107 to 21467. [2019-09-08 11:58:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21467 states. [2019-09-08 11:58:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21467 states to 21467 states and 30412 transitions. [2019-09-08 11:58:17,483 INFO L78 Accepts]: Start accepts. Automaton has 21467 states and 30412 transitions. Word has length 128 [2019-09-08 11:58:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:17,484 INFO L475 AbstractCegarLoop]: Abstraction has 21467 states and 30412 transitions. [2019-09-08 11:58:17,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21467 states and 30412 transitions. [2019-09-08 11:58:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:58:17,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:17,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:17,495 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash -11712549, now seen corresponding path program 1 times [2019-09-08 11:58:17,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:17,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:17,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:17,651 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 11:58:17,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:17,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:17,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:17,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:17,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:17,653 INFO L87 Difference]: Start difference. First operand 21467 states and 30412 transitions. Second operand 7 states. [2019-09-08 11:58:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:20,160 INFO L93 Difference]: Finished difference Result 46147 states and 66151 transitions. [2019-09-08 11:58:20,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:20,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-08 11:58:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:20,212 INFO L225 Difference]: With dead ends: 46147 [2019-09-08 11:58:20,212 INFO L226 Difference]: Without dead ends: 40561 [2019-09-08 11:58:20,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40561 states. [2019-09-08 11:58:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40561 to 25436. [2019-09-08 11:58:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25436 states. [2019-09-08 11:58:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25436 states to 25436 states and 36074 transitions. [2019-09-08 11:58:22,589 INFO L78 Accepts]: Start accepts. Automaton has 25436 states and 36074 transitions. Word has length 128 [2019-09-08 11:58:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:22,590 INFO L475 AbstractCegarLoop]: Abstraction has 25436 states and 36074 transitions. [2019-09-08 11:58:22,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25436 states and 36074 transitions. [2019-09-08 11:58:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:58:22,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:22,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:22,603 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1708899051, now seen corresponding path program 1 times [2019-09-08 11:58:22,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:22,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:22,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:22,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:22,738 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 11:58:22,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:22,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:58:22,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:58:22,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:58:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:58:22,740 INFO L87 Difference]: Start difference. First operand 25436 states and 36074 transitions. Second operand 7 states. [2019-09-08 11:58:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:24,917 INFO L93 Difference]: Finished difference Result 44527 states and 63959 transitions. [2019-09-08 11:58:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:58:24,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-08 11:58:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:24,977 INFO L225 Difference]: With dead ends: 44527 [2019-09-08 11:58:24,977 INFO L226 Difference]: Without dead ends: 40765 [2019-09-08 11:58:24,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40765 states. [2019-09-08 11:58:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40765 to 28099. [2019-09-08 11:58:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28099 states. [2019-09-08 11:58:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28099 states to 28099 states and 39940 transitions. [2019-09-08 11:58:26,781 INFO L78 Accepts]: Start accepts. Automaton has 28099 states and 39940 transitions. Word has length 128 [2019-09-08 11:58:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:26,781 INFO L475 AbstractCegarLoop]: Abstraction has 28099 states and 39940 transitions. [2019-09-08 11:58:26,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:58:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 28099 states and 39940 transitions. [2019-09-08 11:58:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:58:26,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:26,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:26,794 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:26,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:26,795 INFO L82 PathProgramCache]: Analyzing trace with hash -94422578, now seen corresponding path program 1 times [2019-09-08 11:58:26,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:26,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:26,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:27,158 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2019-09-08 11:58:27,295 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 11:58:27,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:27,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:58:27,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:58:27,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:58:27,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:58:27,296 INFO L87 Difference]: Start difference. First operand 28099 states and 39940 transitions. Second operand 14 states. [2019-09-08 11:58:31,219 WARN L188 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-08 11:58:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:43,650 INFO L93 Difference]: Finished difference Result 250181 states and 353545 transitions. [2019-09-08 11:58:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 11:58:43,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-08 11:58:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:44,087 INFO L225 Difference]: With dead ends: 250181 [2019-09-08 11:58:44,088 INFO L226 Difference]: Without dead ends: 223114 [2019-09-08 11:58:44,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 11:58:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223114 states. [2019-09-08 11:58:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223114 to 28259. [2019-09-08 11:58:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28259 states. [2019-09-08 11:58:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28259 states to 28259 states and 40162 transitions. [2019-09-08 11:58:49,481 INFO L78 Accepts]: Start accepts. Automaton has 28259 states and 40162 transitions. Word has length 130 [2019-09-08 11:58:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:49,481 INFO L475 AbstractCegarLoop]: Abstraction has 28259 states and 40162 transitions. [2019-09-08 11:58:49,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:58:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 28259 states and 40162 transitions. [2019-09-08 11:58:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:58:49,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:49,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:49,493 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash 188022920, now seen corresponding path program 1 times [2019-09-08 11:58:49,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:49,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:49,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:49,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:49,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:49,725 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 11:58:49,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:49,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:58:49,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:58:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:58:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:58:49,727 INFO L87 Difference]: Start difference. First operand 28259 states and 40162 transitions. Second operand 10 states. [2019-09-08 11:59:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:08,101 INFO L93 Difference]: Finished difference Result 207992 states and 296463 transitions. [2019-09-08 11:59:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:59:08,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-09-08 11:59:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:08,330 INFO L225 Difference]: With dead ends: 207992 [2019-09-08 11:59:08,330 INFO L226 Difference]: Without dead ends: 188537 [2019-09-08 11:59:08,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:59:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188537 states. [2019-09-08 11:59:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188537 to 28281. [2019-09-08 11:59:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28281 states. [2019-09-08 11:59:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28281 states to 28281 states and 40186 transitions. [2019-09-08 11:59:12,141 INFO L78 Accepts]: Start accepts. Automaton has 28281 states and 40186 transitions. Word has length 130 [2019-09-08 11:59:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:12,142 INFO L475 AbstractCegarLoop]: Abstraction has 28281 states and 40186 transitions. [2019-09-08 11:59:12,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:59:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28281 states and 40186 transitions. [2019-09-08 11:59:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:59:12,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:12,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:12,156 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:12,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1678184802, now seen corresponding path program 1 times [2019-09-08 11:59:12,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:12,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:12,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:12,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:12,231 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 11:59:12,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:12,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:12,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:12,233 INFO L87 Difference]: Start difference. First operand 28281 states and 40186 transitions. Second operand 3 states. [2019-09-08 11:59:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:13,703 INFO L93 Difference]: Finished difference Result 41549 states and 59072 transitions. [2019-09-08 11:59:13,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:13,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-08 11:59:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:13,722 INFO L225 Difference]: With dead ends: 41549 [2019-09-08 11:59:13,722 INFO L226 Difference]: Without dead ends: 14437 [2019-09-08 11:59:13,746 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 11:59:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14437 states. [2019-09-08 11:59:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14437 to 14435. [2019-09-08 11:59:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14435 states. [2019-09-08 11:59:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14435 states to 14435 states and 20303 transitions. [2019-09-08 11:59:15,411 INFO L78 Accepts]: Start accepts. Automaton has 14435 states and 20303 transitions. Word has length 130 [2019-09-08 11:59:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:15,411 INFO L475 AbstractCegarLoop]: Abstraction has 14435 states and 20303 transitions. [2019-09-08 11:59:15,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 14435 states and 20303 transitions. [2019-09-08 11:59:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:59:15,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:15,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:15,422 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1152932228, now seen corresponding path program 1 times [2019-09-08 11:59:15,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:15,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:15,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:15,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:15,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:15,629 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 11:59:15,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:59:15,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:59:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:59:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:59:15,631 INFO L87 Difference]: Start difference. First operand 14435 states and 20303 transitions. Second operand 10 states. [2019-09-08 11:59:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:28,416 INFO L93 Difference]: Finished difference Result 116330 states and 164171 transitions. [2019-09-08 11:59:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:59:28,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-09-08 11:59:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:28,550 INFO L225 Difference]: With dead ends: 116330 [2019-09-08 11:59:28,550 INFO L226 Difference]: Without dead ends: 101938 [2019-09-08 11:59:28,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:59:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101938 states. [2019-09-08 11:59:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101938 to 24390. [2019-09-08 11:59:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24390 states. [2019-09-08 11:59:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24390 states to 24390 states and 34259 transitions. [2019-09-08 11:59:31,949 INFO L78 Accepts]: Start accepts. Automaton has 24390 states and 34259 transitions. Word has length 130 [2019-09-08 11:59:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:31,949 INFO L475 AbstractCegarLoop]: Abstraction has 24390 states and 34259 transitions. [2019-09-08 11:59:31,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:59:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 24390 states and 34259 transitions. [2019-09-08 11:59:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:59:31,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:31,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:31,958 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1123357200, now seen corresponding path program 1 times [2019-09-08 11:59:31,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:31,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:31,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:32,035 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 11:59:32,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:32,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:32,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:32,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:32,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:32,036 INFO L87 Difference]: Start difference. First operand 24390 states and 34259 transitions. Second operand 3 states. [2019-09-08 11:59:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:33,256 INFO L93 Difference]: Finished difference Result 33754 states and 47561 transitions. [2019-09-08 11:59:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:33,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-08 11:59:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:33,268 INFO L225 Difference]: With dead ends: 33754 [2019-09-08 11:59:33,269 INFO L226 Difference]: Without dead ends: 10694 [2019-09-08 11:59:33,287 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 11:59:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2019-09-08 11:59:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 10692. [2019-09-08 11:59:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10692 states. [2019-09-08 11:59:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10692 states to 10692 states and 15025 transitions. [2019-09-08 11:59:34,470 INFO L78 Accepts]: Start accepts. Automaton has 10692 states and 15025 transitions. Word has length 130 [2019-09-08 11:59:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:34,470 INFO L475 AbstractCegarLoop]: Abstraction has 10692 states and 15025 transitions. [2019-09-08 11:59:34,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 10692 states and 15025 transitions. [2019-09-08 11:59:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:59:34,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:34,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:34,475 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:34,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash -984371191, now seen corresponding path program 1 times [2019-09-08 11:59:34,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:34,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:34,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:34,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:34,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:34,536 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 11:59:34,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:34,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:34,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:34,537 INFO L87 Difference]: Start difference. First operand 10692 states and 15025 transitions. Second operand 3 states. [2019-09-08 11:59:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:35,500 INFO L93 Difference]: Finished difference Result 17565 states and 24821 transitions. [2019-09-08 11:59:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:35,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 11:59:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:35,508 INFO L225 Difference]: With dead ends: 17565 [2019-09-08 11:59:35,508 INFO L226 Difference]: Without dead ends: 7029 [2019-09-08 11:59:35,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7029 states. [2019-09-08 11:59:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7029 to 7029. [2019-09-08 11:59:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7029 states. [2019-09-08 11:59:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7029 states to 7029 states and 9867 transitions. [2019-09-08 11:59:36,279 INFO L78 Accepts]: Start accepts. Automaton has 7029 states and 9867 transitions. Word has length 131 [2019-09-08 11:59:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:36,279 INFO L475 AbstractCegarLoop]: Abstraction has 7029 states and 9867 transitions. [2019-09-08 11:59:36,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7029 states and 9867 transitions. [2019-09-08 11:59:36,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:59:36,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:36,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:36,283 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1829066464, now seen corresponding path program 1 times [2019-09-08 11:59:36,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:36,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:36,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:36,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:36,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:36,548 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 11:59:36,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:36,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:59:36,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:59:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:59:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:59:36,550 INFO L87 Difference]: Start difference. First operand 7029 states and 9867 transitions. Second operand 10 states. [2019-09-08 11:59:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:44,278 INFO L93 Difference]: Finished difference Result 59376 states and 83341 transitions. [2019-09-08 11:59:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:59:44,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-09-08 11:59:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:44,340 INFO L225 Difference]: With dead ends: 59376 [2019-09-08 11:59:44,340 INFO L226 Difference]: Without dead ends: 52952 [2019-09-08 11:59:44,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:59:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52952 states. [2019-09-08 11:59:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52952 to 7209. [2019-09-08 11:59:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2019-09-08 11:59:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 10081 transitions. [2019-09-08 11:59:45,656 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 10081 transitions. Word has length 131 [2019-09-08 11:59:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:45,656 INFO L475 AbstractCegarLoop]: Abstraction has 7209 states and 10081 transitions. [2019-09-08 11:59:45,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:59:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 10081 transitions. [2019-09-08 11:59:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:59:45,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:45,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:45,659 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 999887890, now seen corresponding path program 1 times [2019-09-08 11:59:45,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:45,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:45,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:45,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:45,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:45,722 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 11:59:45,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:45,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:45,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:45,724 INFO L87 Difference]: Start difference. First operand 7209 states and 10081 transitions. Second operand 3 states. [2019-09-08 11:59:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:46,244 INFO L93 Difference]: Finished difference Result 10293 states and 14421 transitions. [2019-09-08 11:59:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:46,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 11:59:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:46,250 INFO L225 Difference]: With dead ends: 10293 [2019-09-08 11:59:46,250 INFO L226 Difference]: Without dead ends: 3845 [2019-09-08 11:59:46,257 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 11:59:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2019-09-08 11:59:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3843. [2019-09-08 11:59:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3843 states. [2019-09-08 11:59:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 5280 transitions. [2019-09-08 11:59:46,769 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 5280 transitions. Word has length 131 [2019-09-08 11:59:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:46,769 INFO L475 AbstractCegarLoop]: Abstraction has 3843 states and 5280 transitions. [2019-09-08 11:59:46,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 5280 transitions. [2019-09-08 11:59:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:59:46,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:46,771 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:46,771 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1261748561, now seen corresponding path program 1 times [2019-09-08 11:59:46,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:46,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:46,986 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 11:59:46,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:46,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:59:46,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:59:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:59:46,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:59:46,988 INFO L87 Difference]: Start difference. First operand 3843 states and 5280 transitions. Second operand 10 states. [2019-09-08 11:59:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:52,084 INFO L93 Difference]: Finished difference Result 30154 states and 41851 transitions. [2019-09-08 11:59:52,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:59:52,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2019-09-08 11:59:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:52,114 INFO L225 Difference]: With dead ends: 30154 [2019-09-08 11:59:52,115 INFO L226 Difference]: Without dead ends: 26976 [2019-09-08 11:59:52,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:59:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26976 states. [2019-09-08 11:59:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26976 to 4239. [2019-09-08 11:59:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-09-08 11:59:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 5766 transitions. [2019-09-08 11:59:52,913 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 5766 transitions. Word has length 132 [2019-09-08 11:59:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:52,914 INFO L475 AbstractCegarLoop]: Abstraction has 4239 states and 5766 transitions. [2019-09-08 11:59:52,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:59:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 5766 transitions. [2019-09-08 11:59:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:59:52,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:52,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:52,916 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:52,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1979861581, now seen corresponding path program 1 times [2019-09-08 11:59:52,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:52,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:52,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:52,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:52,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:52,992 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 11:59:52,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:52,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:52,993 INFO L87 Difference]: Start difference. First operand 4239 states and 5766 transitions. Second operand 3 states. [2019-09-08 11:59:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:53,407 INFO L93 Difference]: Finished difference Result 5783 states and 7917 transitions. [2019-09-08 11:59:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:53,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-08 11:59:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:53,410 INFO L225 Difference]: With dead ends: 5783 [2019-09-08 11:59:53,410 INFO L226 Difference]: Without dead ends: 2589 [2019-09-08 11:59:53,413 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 11:59:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-09-08 11:59:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2587. [2019-09-08 11:59:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2587 states. [2019-09-08 11:59:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3426 transitions. [2019-09-08 11:59:53,777 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3426 transitions. Word has length 132 [2019-09-08 11:59:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:53,778 INFO L475 AbstractCegarLoop]: Abstraction has 2587 states and 3426 transitions. [2019-09-08 11:59:53,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3426 transitions. [2019-09-08 11:59:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:59:53,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:53,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:53,780 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1909986315, now seen corresponding path program 1 times [2019-09-08 11:59:53,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:53,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:53,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:53,872 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 11:59:53,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:53,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:59:53,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:59:53,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:59:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:59:53,873 INFO L87 Difference]: Start difference. First operand 2587 states and 3426 transitions. Second operand 4 states. [2019-09-08 11:59:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:54,273 INFO L93 Difference]: Finished difference Result 4161 states and 5588 transitions. [2019-09-08 11:59:54,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:59:54,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 11:59:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:54,276 INFO L225 Difference]: With dead ends: 4161 [2019-09-08 11:59:54,276 INFO L226 Difference]: Without dead ends: 2583 [2019-09-08 11:59:54,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:59:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-09-08 11:59:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2582. [2019-09-08 11:59:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2019-09-08 11:59:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3394 transitions. [2019-09-08 11:59:54,616 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3394 transitions. Word has length 133 [2019-09-08 11:59:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:54,617 INFO L475 AbstractCegarLoop]: Abstraction has 2582 states and 3394 transitions. [2019-09-08 11:59:54,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:59:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3394 transitions. [2019-09-08 11:59:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 11:59:54,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:54,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:54,619 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1901756694, now seen corresponding path program 1 times [2019-09-08 11:59:54,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:54,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:54,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:54,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:54,680 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 11:59:54,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:54,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:54,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:54,682 INFO L87 Difference]: Start difference. First operand 2582 states and 3394 transitions. Second operand 3 states. [2019-09-08 11:59:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:55,213 INFO L93 Difference]: Finished difference Result 4975 states and 6556 transitions. [2019-09-08 11:59:55,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:55,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-09-08 11:59:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:55,217 INFO L225 Difference]: With dead ends: 4975 [2019-09-08 11:59:55,217 INFO L226 Difference]: Without dead ends: 3414 [2019-09-08 11:59:55,220 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 11:59:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2019-09-08 11:59:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3312. [2019-09-08 11:59:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2019-09-08 11:59:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 4217 transitions. [2019-09-08 11:59:55,750 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 4217 transitions. Word has length 135 [2019-09-08 11:59:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:55,750 INFO L475 AbstractCegarLoop]: Abstraction has 3312 states and 4217 transitions. [2019-09-08 11:59:55,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 4217 transitions. [2019-09-08 11:59:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 11:59:55,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:55,753 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:55,753 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -775741639, now seen corresponding path program 1 times [2019-09-08 11:59:55,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:55,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:55,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:55,841 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 11:59:55,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:55,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:55,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:55,843 INFO L87 Difference]: Start difference. First operand 3312 states and 4217 transitions. Second operand 3 states. [2019-09-08 11:59:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:56,507 INFO L93 Difference]: Finished difference Result 4673 states and 6022 transitions. [2019-09-08 11:59:56,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:56,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 11:59:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:56,512 INFO L225 Difference]: With dead ends: 4673 [2019-09-08 11:59:56,512 INFO L226 Difference]: Without dead ends: 3653 [2019-09-08 11:59:56,514 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 11:59:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2019-09-08 11:59:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3291. [2019-09-08 11:59:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3291 states. [2019-09-08 11:59:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4182 transitions. [2019-09-08 11:59:57,016 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4182 transitions. Word has length 136 [2019-09-08 11:59:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:57,017 INFO L475 AbstractCegarLoop]: Abstraction has 3291 states and 4182 transitions. [2019-09-08 11:59:57,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4182 transitions. [2019-09-08 11:59:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 11:59:57,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:57,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:57,020 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1789290556, now seen corresponding path program 1 times [2019-09-08 11:59:57,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:57,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:57,087 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 11:59:57,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:57,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:57,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:57,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:57,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:57,088 INFO L87 Difference]: Start difference. First operand 3291 states and 4182 transitions. Second operand 3 states. [2019-09-08 11:59:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:57,684 INFO L93 Difference]: Finished difference Result 4787 states and 6131 transitions. [2019-09-08 11:59:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:57,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-08 11:59:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:57,688 INFO L225 Difference]: With dead ends: 4787 [2019-09-08 11:59:57,688 INFO L226 Difference]: Without dead ends: 3505 [2019-09-08 11:59:57,689 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 11:59:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2019-09-08 11:59:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 3074. [2019-09-08 11:59:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2019-09-08 11:59:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3879 transitions. [2019-09-08 11:59:58,234 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3879 transitions. Word has length 137 [2019-09-08 11:59:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:58,234 INFO L475 AbstractCegarLoop]: Abstraction has 3074 states and 3879 transitions. [2019-09-08 11:59:58,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3879 transitions. [2019-09-08 11:59:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 11:59:58,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:58,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:58,236 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:58,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:58,237 INFO L82 PathProgramCache]: Analyzing trace with hash 747257794, now seen corresponding path program 1 times [2019-09-08 11:59:58,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:58,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:58,301 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 11:59:58,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:58,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:58,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:58,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:58,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:58,302 INFO L87 Difference]: Start difference. First operand 3074 states and 3879 transitions. Second operand 3 states. [2019-09-08 11:59:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:59,098 INFO L93 Difference]: Finished difference Result 5223 states and 6644 transitions. [2019-09-08 11:59:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:59,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-08 11:59:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:59,101 INFO L225 Difference]: With dead ends: 5223 [2019-09-08 11:59:59,101 INFO L226 Difference]: Without dead ends: 3163 [2019-09-08 11:59:59,104 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 11:59:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-09-08 11:59:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3076. [2019-09-08 11:59:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-09-08 11:59:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 3850 transitions. [2019-09-08 11:59:59,623 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 3850 transitions. Word has length 137 [2019-09-08 11:59:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:59,623 INFO L475 AbstractCegarLoop]: Abstraction has 3076 states and 3850 transitions. [2019-09-08 11:59:59,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 3850 transitions. [2019-09-08 11:59:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 11:59:59,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:59,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:59,625 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1357258310, now seen corresponding path program 1 times [2019-09-08 11:59:59,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:59,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:59,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:59,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:59,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 11:59:59,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:59,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:59:59,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:59:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:59:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:59:59,729 INFO L87 Difference]: Start difference. First operand 3076 states and 3850 transitions. Second operand 6 states. [2019-09-08 12:00:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:00,657 INFO L93 Difference]: Finished difference Result 4453 states and 5652 transitions. [2019-09-08 12:00:00,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:00:00,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-09-08 12:00:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:00,662 INFO L225 Difference]: With dead ends: 4453 [2019-09-08 12:00:00,662 INFO L226 Difference]: Without dead ends: 4451 [2019-09-08 12:00:00,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:00:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4451 states. [2019-09-08 12:00:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4451 to 3128. [2019-09-08 12:00:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2019-09-08 12:00:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 3894 transitions. [2019-09-08 12:00:01,207 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 3894 transitions. Word has length 137 [2019-09-08 12:00:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:01,207 INFO L475 AbstractCegarLoop]: Abstraction has 3128 states and 3894 transitions. [2019-09-08 12:00:01,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:00:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 3894 transitions. [2019-09-08 12:00:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:00:01,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:01,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:01,210 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:01,210 INFO L82 PathProgramCache]: Analyzing trace with hash 590602360, now seen corresponding path program 1 times [2019-09-08 12:00:01,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:01,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:01,271 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 12:00:01,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:00:01,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:00:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:00:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:00:01,273 INFO L87 Difference]: Start difference. First operand 3128 states and 3894 transitions. Second operand 3 states. [2019-09-08 12:00:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:02,161 INFO L93 Difference]: Finished difference Result 6118 states and 7696 transitions. [2019-09-08 12:00:02,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:00:02,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:00:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:02,165 INFO L225 Difference]: With dead ends: 6118 [2019-09-08 12:00:02,165 INFO L226 Difference]: Without dead ends: 4120 [2019-09-08 12:00:02,167 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 12:00:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-09-08 12:00:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4118. [2019-09-08 12:00:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4118 states. [2019-09-08 12:00:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 5130 transitions. [2019-09-08 12:00:02,971 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 5130 transitions. Word has length 138 [2019-09-08 12:00:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:02,972 INFO L475 AbstractCegarLoop]: Abstraction has 4118 states and 5130 transitions. [2019-09-08 12:00:02,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:00:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 5130 transitions. [2019-09-08 12:00:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:00:02,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:02,974 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:02,974 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1537561535, now seen corresponding path program 1 times [2019-09-08 12:00:02,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:02,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:02,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:02,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:02,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:00:03,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:00:03,290 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 12:00:03,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:03,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 12:00:03,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:00:03,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:03,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:03,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:00:04,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:00:04,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-08 12:00:04,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 12:00:04,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 12:00:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:00:04,248 INFO L87 Difference]: Start difference. First operand 4118 states and 5130 transitions. Second operand 23 states. [2019-09-08 12:00:04,399 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:00:06,958 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:00:07,553 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-08 12:00:08,575 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 12:00:08,992 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:00:09,154 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:00:10,194 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:00:10,377 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 12:00:10,518 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:00:11,018 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:00:11,301 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:00:11,505 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-08 12:00:12,003 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:00:12,182 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:00:12,850 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:00:13,016 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:00:13,212 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:00:13,403 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:00:13,567 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:00:14,627 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:00:15,298 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:00:15,517 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:00:15,805 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-08 12:00:15,995 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:00:16,130 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:00:16,292 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-08 12:00:16,854 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:00:17,398 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:00:17,616 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:00:17,941 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:00:18,226 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 12:00:18,445 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:00:19,743 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:00:19,973 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-08 12:00:20,210 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:00:20,768 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:00:21,016 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:00:21,939 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:00:22,202 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-08 12:00:22,469 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:00:23,157 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:00:23,331 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:00:23,524 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-08 12:00:23,741 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:00:23,891 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:00:24,092 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:00:24,445 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:00:24,693 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:00:25,295 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:00:25,468 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:00:25,690 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:00:25,888 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:00:26,398 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:00:26,876 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 12:00:27,219 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:00:36,865 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-08 12:00:37,201 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 12:00:37,365 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:00:37,547 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 12:00:38,036 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 12:00:38,226 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:00:38,444 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:00:38,636 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-08 12:00:38,844 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:00:39,088 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-08 12:00:39,383 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:00:39,584 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:00:39,849 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-08 12:00:40,049 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:00:40,664 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:00:40,853 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:00:41,031 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:00:41,221 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 12:00:41,441 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:00:41,611 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:00:41,820 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:00:42,035 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 12:00:42,725 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:00:43,976 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-08 12:00:44,176 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:00:44,383 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 12:00:49,061 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:00:49,867 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-08 12:00:50,053 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:00:50,240 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-08 12:00:50,622 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-08 12:00:50,999 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-08 12:00:51,311 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 12:00:51,554 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-08 12:00:51,701 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-08 12:00:51,871 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-08 12:00:52,080 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:00:52,806 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-08 12:00:53,007 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:00:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:59,090 INFO L93 Difference]: Finished difference Result 92784 states and 115145 transitions. [2019-09-08 12:00:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-08 12:00:59,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 165 [2019-09-08 12:00:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:59,265 INFO L225 Difference]: With dead ends: 92784 [2019-09-08 12:00:59,265 INFO L226 Difference]: Without dead ends: 89680 [2019-09-08 12:00:59,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10782 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=5007, Invalid=27213, Unknown=0, NotChecked=0, Total=32220 [2019-09-08 12:00:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89680 states. [2019-09-08 12:01:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89680 to 22014. [2019-09-08 12:01:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-09-08 12:01:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 27191 transitions. [2019-09-08 12:01:07,245 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 27191 transitions. Word has length 165 [2019-09-08 12:01:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:07,245 INFO L475 AbstractCegarLoop]: Abstraction has 22014 states and 27191 transitions. [2019-09-08 12:01:07,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 12:01:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 27191 transitions. [2019-09-08 12:01:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:01:07,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:07,273 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:07,273 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1752327572, now seen corresponding path program 1 times [2019-09-08 12:01:07,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:07,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:07,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:07,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:01:07,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:07,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:01:07,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:01:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:01:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:01:07,454 INFO L87 Difference]: Start difference. First operand 22014 states and 27191 transitions. Second operand 4 states. [2019-09-08 12:01:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:14,097 INFO L93 Difference]: Finished difference Result 42064 states and 51769 transitions. [2019-09-08 12:01:14,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:01:14,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-08 12:01:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:14,135 INFO L225 Difference]: With dead ends: 42064 [2019-09-08 12:01:14,135 INFO L226 Difference]: Without dead ends: 23610 [2019-09-08 12:01:14,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:01:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23610 states. [2019-09-08 12:01:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23610 to 21870. [2019-09-08 12:01:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21870 states. [2019-09-08 12:01:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21870 states to 21870 states and 27011 transitions. [2019-09-08 12:01:20,489 INFO L78 Accepts]: Start accepts. Automaton has 21870 states and 27011 transitions. Word has length 165 [2019-09-08 12:01:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:20,489 INFO L475 AbstractCegarLoop]: Abstraction has 21870 states and 27011 transitions. [2019-09-08 12:01:20,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:01:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 21870 states and 27011 transitions. [2019-09-08 12:01:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:01:20,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:20,496 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:20,496 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1435932244, now seen corresponding path program 1 times [2019-09-08 12:01:20,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:20,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:20,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 12:01:20,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:01:20,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:01:20,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:01:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:01:20,617 INFO L87 Difference]: Start difference. First operand 21870 states and 27011 transitions. Second operand 5 states. [2019-09-08 12:01:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:29,150 INFO L93 Difference]: Finished difference Result 34858 states and 43110 transitions. [2019-09-08 12:01:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:01:29,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 12:01:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:29,190 INFO L225 Difference]: With dead ends: 34858 [2019-09-08 12:01:29,190 INFO L226 Difference]: Without dead ends: 26406 [2019-09-08 12:01:29,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:01:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26406 states. [2019-09-08 12:01:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26406 to 22560. [2019-09-08 12:01:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22560 states. [2019-09-08 12:01:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22560 states to 22560 states and 27882 transitions. [2019-09-08 12:01:36,092 INFO L78 Accepts]: Start accepts. Automaton has 22560 states and 27882 transitions. Word has length 165 [2019-09-08 12:01:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:36,092 INFO L475 AbstractCegarLoop]: Abstraction has 22560 states and 27882 transitions. [2019-09-08 12:01:36,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:01:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 22560 states and 27882 transitions. [2019-09-08 12:01:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:01:36,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:36,097 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:36,097 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash 708718815, now seen corresponding path program 1 times [2019-09-08 12:01:36,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:36,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 12:01:36,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:36,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:01:36,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:01:36,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:01:36,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:01:36,225 INFO L87 Difference]: Start difference. First operand 22560 states and 27882 transitions. Second operand 5 states. [2019-09-08 12:01:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:44,483 INFO L93 Difference]: Finished difference Result 38904 states and 48199 transitions. [2019-09-08 12:01:44,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:01:44,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 12:01:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:44,519 INFO L225 Difference]: With dead ends: 38904 [2019-09-08 12:01:44,519 INFO L226 Difference]: Without dead ends: 27476 [2019-09-08 12:01:44,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:01:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27476 states. [2019-09-08 12:01:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27476 to 20872. [2019-09-08 12:01:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20872 states. [2019-09-08 12:01:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20872 states to 20872 states and 25828 transitions. [2019-09-08 12:01:51,624 INFO L78 Accepts]: Start accepts. Automaton has 20872 states and 25828 transitions. Word has length 165 [2019-09-08 12:01:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:51,624 INFO L475 AbstractCegarLoop]: Abstraction has 20872 states and 25828 transitions. [2019-09-08 12:01:51,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:01:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 20872 states and 25828 transitions. [2019-09-08 12:01:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:01:51,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:51,629 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:01:51,629 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1897894619, now seen corresponding path program 1 times [2019-09-08 12:01:51,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:51,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:51,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:01:51,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:01:51,950 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 12:01:51,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:52,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 12:01:52,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:01:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:01:52,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:01:52,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-09-08 12:01:52,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:01:52,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:01:52,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:01:52,271 INFO L87 Difference]: Start difference. First operand 20872 states and 25828 transitions. Second operand 17 states. [2019-09-08 12:01:54,396 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 12:01:55,142 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 12:01:57,417 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 12:02:08,308 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:02:09,085 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 12:02:09,216 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 12:02:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:33,171 INFO L93 Difference]: Finished difference Result 114051 states and 140959 transitions. [2019-09-08 12:02:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 12:02:33,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 165 [2019-09-08 12:02:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:33,260 INFO L225 Difference]: With dead ends: 114051 [2019-09-08 12:02:33,260 INFO L226 Difference]: Without dead ends: 94220 [2019-09-08 12:02:33,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=762, Invalid=2318, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 12:02:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94220 states. [2019-09-08 12:02:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94220 to 62626. [2019-09-08 12:02:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62626 states. [2019-09-08 12:02:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62626 states to 62626 states and 77171 transitions. [2019-09-08 12:02:58,217 INFO L78 Accepts]: Start accepts. Automaton has 62626 states and 77171 transitions. Word has length 165 [2019-09-08 12:02:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:58,217 INFO L475 AbstractCegarLoop]: Abstraction has 62626 states and 77171 transitions. [2019-09-08 12:02:58,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:02:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 62626 states and 77171 transitions. [2019-09-08 12:02:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 12:02:58,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:58,226 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:58,226 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:58,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:58,227 INFO L82 PathProgramCache]: Analyzing trace with hash 211863944, now seen corresponding path program 1 times [2019-09-08 12:02:58,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:58,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:58,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:58,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:58,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:02:58,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:58,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:58,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:58,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:58,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:58,283 INFO L87 Difference]: Start difference. First operand 62626 states and 77171 transitions. Second operand 3 states. [2019-09-08 12:03:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:14,638 INFO L93 Difference]: Finished difference Result 108812 states and 134334 transitions. [2019-09-08 12:03:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:14,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 12:03:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:14,688 INFO L225 Difference]: With dead ends: 108812 [2019-09-08 12:03:14,688 INFO L226 Difference]: Without dead ends: 46672 [2019-09-08 12:03:14,720 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 12:03:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46672 states. [2019-09-08 12:03:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46672 to 46672. [2019-09-08 12:03:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46672 states. [2019-09-08 12:03:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46672 states to 46672 states and 57000 transitions. [2019-09-08 12:03:32,281 INFO L78 Accepts]: Start accepts. Automaton has 46672 states and 57000 transitions. Word has length 165 [2019-09-08 12:03:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:32,281 INFO L475 AbstractCegarLoop]: Abstraction has 46672 states and 57000 transitions. [2019-09-08 12:03:32,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46672 states and 57000 transitions. [2019-09-08 12:03:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:03:32,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:32,288 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:32,288 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash -674376392, now seen corresponding path program 1 times [2019-09-08 12:03:32,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:32,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:32,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:03:32,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:32,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:32,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:32,362 INFO L87 Difference]: Start difference. First operand 46672 states and 57000 transitions. Second operand 3 states. [2019-09-08 12:03:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:44,766 INFO L93 Difference]: Finished difference Result 82474 states and 100669 transitions. [2019-09-08 12:03:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:44,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 12:03:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:44,807 INFO L225 Difference]: With dead ends: 82474 [2019-09-08 12:03:44,807 INFO L226 Difference]: Without dead ends: 36191 [2019-09-08 12:03:44,835 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 12:03:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36191 states. [2019-09-08 12:03:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36191 to 36191. [2019-09-08 12:03:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36191 states. [2019-09-08 12:03:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36191 states to 36191 states and 43383 transitions. [2019-09-08 12:03:57,759 INFO L78 Accepts]: Start accepts. Automaton has 36191 states and 43383 transitions. Word has length 166 [2019-09-08 12:03:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:57,759 INFO L475 AbstractCegarLoop]: Abstraction has 36191 states and 43383 transitions. [2019-09-08 12:03:57,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 36191 states and 43383 transitions. [2019-09-08 12:03:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:03:57,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:57,764 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:57,764 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -93010058, now seen corresponding path program 1 times [2019-09-08 12:03:57,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:57,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:57,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:57,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 12:03:57,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:57,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:03:57,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:03:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:03:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:03:57,885 INFO L87 Difference]: Start difference. First operand 36191 states and 43383 transitions. Second operand 5 states. [2019-09-08 12:04:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:14,346 INFO L93 Difference]: Finished difference Result 72197 states and 86610 transitions. [2019-09-08 12:04:14,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:14,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-08 12:04:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:14,383 INFO L225 Difference]: With dead ends: 72197 [2019-09-08 12:04:14,384 INFO L226 Difference]: Without dead ends: 43651 [2019-09-08 12:04:14,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:04:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43651 states. [2019-09-08 12:04:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43651 to 37253. [2019-09-08 12:04:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37253 states. [2019-09-08 12:04:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37253 states to 37253 states and 44668 transitions. [2019-09-08 12:04:27,355 INFO L78 Accepts]: Start accepts. Automaton has 37253 states and 44668 transitions. Word has length 166 [2019-09-08 12:04:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:27,356 INFO L475 AbstractCegarLoop]: Abstraction has 37253 states and 44668 transitions. [2019-09-08 12:04:27,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37253 states and 44668 transitions. [2019-09-08 12:04:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:04:27,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:27,360 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:27,360 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2018908650, now seen corresponding path program 1 times [2019-09-08 12:04:27,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:27,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:04:27,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:27,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:04:27,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:04:27,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:04:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:04:27,547 INFO L87 Difference]: Start difference. First operand 37253 states and 44668 transitions. Second operand 7 states. [2019-09-08 12:04:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:54,074 INFO L93 Difference]: Finished difference Result 86281 states and 103952 transitions. [2019-09-08 12:04:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:04:54,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 166 [2019-09-08 12:04:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:54,142 INFO L225 Difference]: With dead ends: 86281 [2019-09-08 12:04:54,142 INFO L226 Difference]: Without dead ends: 69653 [2019-09-08 12:04:54,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:04:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69653 states. [2019-09-08 12:05:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69653 to 46193. [2019-09-08 12:05:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46193 states. [2019-09-08 12:05:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46193 states to 46193 states and 55407 transitions. [2019-09-08 12:05:12,023 INFO L78 Accepts]: Start accepts. Automaton has 46193 states and 55407 transitions. Word has length 166 [2019-09-08 12:05:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:12,023 INFO L475 AbstractCegarLoop]: Abstraction has 46193 states and 55407 transitions. [2019-09-08 12:05:12,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:05:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 46193 states and 55407 transitions. [2019-09-08 12:05:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:05:12,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:12,028 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:12,028 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1301612106, now seen corresponding path program 1 times [2019-09-08 12:05:12,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:12,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:05:12,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:12,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:05:12,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:05:12,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:05:12,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:05:12,124 INFO L87 Difference]: Start difference. First operand 46193 states and 55407 transitions. Second operand 5 states. [2019-09-08 12:05:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:47,334 INFO L93 Difference]: Finished difference Result 141473 states and 170295 transitions. [2019-09-08 12:05:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:05:47,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-09-08 12:05:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:47,456 INFO L225 Difference]: With dead ends: 141473 [2019-09-08 12:05:47,456 INFO L226 Difference]: Without dead ends: 99347 [2019-09-08 12:05:47,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:05:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99347 states. [2019-09-08 12:06:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99347 to 81137. [2019-09-08 12:06:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81137 states. [2019-09-08 12:06:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81137 states to 81137 states and 97465 transitions. [2019-09-08 12:06:18,237 INFO L78 Accepts]: Start accepts. Automaton has 81137 states and 97465 transitions. Word has length 166 [2019-09-08 12:06:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:18,237 INFO L475 AbstractCegarLoop]: Abstraction has 81137 states and 97465 transitions. [2019-09-08 12:06:18,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:06:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 81137 states and 97465 transitions. [2019-09-08 12:06:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:06:18,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:18,246 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:06:18,246 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1158956310, now seen corresponding path program 1 times [2019-09-08 12:06:18,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:18,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:18,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:18,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:18,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:06:18,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:06:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:20,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 12:06:20,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:06:20,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:06:20,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:06:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:06:20,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:06:20,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-08 12:06:20,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:06:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:06:20,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:06:20,958 INFO L87 Difference]: Start difference. First operand 81137 states and 97465 transitions. Second operand 21 states. [2019-09-08 12:06:21,248 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 12:06:21,933 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:06:22,539 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 12:06:22,969 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 12:06:23,253 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:06:23,690 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 12:06:23,990 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 12:06:24,334 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-08 12:06:24,728 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 12:06:25,851 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:06:26,198 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-08 12:06:26,559 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 12:06:26,905 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 12:06:27,609 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-08 12:06:28,207 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-08 12:06:28,568 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 12:06:28,979 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-08 12:06:29,378 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-08 12:06:29,767 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-08 12:06:30,042 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-08 12:06:30,328 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-08 12:06:30,647 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-08 12:06:30,906 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 12:06:31,330 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-08 12:06:31,721 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-08 12:06:33,877 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-08 12:06:34,332 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-09-08 12:06:34,817 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 12:06:35,242 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-08 12:06:35,649 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-08 12:06:36,899 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-08 12:06:39,458 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 12:06:39,856 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 12:06:40,590 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-08 12:06:41,251 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-08 12:06:41,668 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:06:42,039 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-08 12:06:42,493 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-08 12:06:42,891 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:06:43,731 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-08 12:06:44,124 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-08 12:06:46,385 WARN L188 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-08 12:06:46,958 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-08 12:06:47,549 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-08 12:06:48,228 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-08 12:06:48,556 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-08 12:06:49,066 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-08 12:06:50,083 WARN L188 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-09-08 12:06:50,491 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-08 12:06:50,765 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 12:06:51,285 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-08 12:06:51,702 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-08 12:06:52,158 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-08 12:06:52,510 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-08 12:06:53,268 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:07:16,124 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-09-08 12:07:18,204 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:07:18,730 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-08 12:07:20,276 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-08 12:07:20,670 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-08 12:07:21,057 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:07:23,308 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-08 12:07:23,880 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-09-08 12:07:25,366 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-08 12:07:25,702 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-09-08 12:07:27,864 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-08 12:07:29,057 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-09-08 12:07:29,820 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-09-08 12:07:31,483 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-08 12:07:32,010 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-09-08 12:07:32,409 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-08 12:07:32,831 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-09-08 12:07:33,221 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-08 12:07:34,581 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-08 12:07:34,975 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-08 12:07:35,482 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-09-08 12:07:37,291 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-08 12:07:37,710 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-09-08 12:07:52,788 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-08 12:07:54,349 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-09-08 12:07:56,634 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-08 12:07:57,592 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-09-08 12:08:00,486 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-08 12:08:01,955 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-09-08 12:08:02,371 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-08 12:08:04,910 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-09-08 12:08:08,292 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85