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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:55:17,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:55:17,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:55:17,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:55:17,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:55:17,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:55:17,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:55:17,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:55:17,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:55:17,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:55:17,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:55:17,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:55:17,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:55:17,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:55:17,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:55:17,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:55:17,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:55:17,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:55:17,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:55:17,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:55:17,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:55:17,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:55:17,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:55:17,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:55:17,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:55:17,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:55:17,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:55:17,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:55:17,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:55:17,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:55:17,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:55:17,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:55:17,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:55:17,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:55:17,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:55:17,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:55:17,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:55:17,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:55:17,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:55:17,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:55:17,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:55:17,388 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:55:17,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:55:17,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:55:17,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:55:17,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:55:17,404 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:55:17,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:55:17,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:55:17,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:55:17,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:55:17,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:55:17,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:55:17,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:55:17,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:55:17,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:55:17,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:55:17,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:55:17,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:55:17,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:55:17,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:55:17,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:55:17,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:55:17,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:55:17,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:55:17,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:55:17,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:55:17,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:55:17,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:55:17,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:55:17,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:55:17,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:55:17,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:55:17,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:55:17,463 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:55:17,463 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:55:17,464 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:55:17,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bb7ff14/f89493f9b688411ba388db5ae87fe31f/FLAGd8f53e737 [2019-09-08 11:55:18,044 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:55:18,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:55:18,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bb7ff14/f89493f9b688411ba388db5ae87fe31f/FLAGd8f53e737 [2019-09-08 11:55:18,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bb7ff14/f89493f9b688411ba388db5ae87fe31f [2019-09-08 11:55:18,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:55:18,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:55:18,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:55:18,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:55:18,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:55:18,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:55:18" (1/1) ... [2019-09-08 11:55:18,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72769e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:18, skipping insertion in model container [2019-09-08 11:55:18,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:55:18" (1/1) ... [2019-09-08 11:55:18,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:55:18,494 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:55:18,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:55:19,016 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:55:19,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:55:19,128 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:55:19,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19 WrapperNode [2019-09-08 11:55:19,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:55:19,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:55:19,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:55:19,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:55:19,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (1/1) ... [2019-09-08 11:55:19,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (1/1) ... [2019-09-08 11:55:19,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (1/1) ... [2019-09-08 11:55:19,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (1/1) ... [2019-09-08 11:55:19,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (1/1) ... [2019-09-08 11:55:19,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (1/1) ... [2019-09-08 11:55:19,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (1/1) ... [2019-09-08 11:55:19,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:55:19,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:55:19,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:55:19,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:55:19,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (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:55:19,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:55:19,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:55:19,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:55:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:55:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:55:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:55:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:55:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:55:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:55:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:55:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:55:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:55:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:55:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:55:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:55:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:55:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:55:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:55:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:55:19,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:55:19,992 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:55:19,993 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:55:19,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:55:19 BoogieIcfgContainer [2019-09-08 11:55:19,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:55:19,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:55:19,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:55:19,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:55:19,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:55:18" (1/3) ... [2019-09-08 11:55:20,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dfe4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:55:19, skipping insertion in model container [2019-09-08 11:55:20,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:55:19" (2/3) ... [2019-09-08 11:55:20,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dfe4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:55:20, skipping insertion in model container [2019-09-08 11:55:20,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:55:19" (3/3) ... [2019-09-08 11:55:20,002 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:55:20,011 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:55:20,018 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:55:20,032 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:55:20,057 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:55:20,058 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:55:20,058 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:55:20,058 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:55:20,058 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:55:20,058 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:55:20,058 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:55:20,059 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:55:20,059 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:55:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2019-09-08 11:55:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:55:20,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:20,085 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] [2019-09-08 11:55:20,087 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash 892664727, now seen corresponding path program 1 times [2019-09-08 11:55:20,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:20,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:20,511 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:55:20,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:20,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:55:20,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:55:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:55:20,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:55:20,538 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2019-09-08 11:55:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:20,701 INFO L93 Difference]: Finished difference Result 252 states and 408 transitions. [2019-09-08 11:55:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:55:20,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:55:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:20,718 INFO L225 Difference]: With dead ends: 252 [2019-09-08 11:55:20,718 INFO L226 Difference]: Without dead ends: 188 [2019-09-08 11:55:20,722 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:55:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-08 11:55:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-09-08 11:55:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-08 11:55:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2019-09-08 11:55:20,783 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 65 [2019-09-08 11:55:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:20,784 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2019-09-08 11:55:20,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:55:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2019-09-08 11:55:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:55:20,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:20,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:20,788 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash -863027836, now seen corresponding path program 1 times [2019-09-08 11:55:20,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:20,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:20,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:21,008 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:55:21,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:21,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:55:21,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:55:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:55:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:55:21,011 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand 5 states. [2019-09-08 11:55:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:21,262 INFO L93 Difference]: Finished difference Result 339 states and 500 transitions. [2019-09-08 11:55:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:21,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 11:55:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:21,266 INFO L225 Difference]: With dead ends: 339 [2019-09-08 11:55:21,266 INFO L226 Difference]: Without dead ends: 186 [2019-09-08 11:55:21,268 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:55:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-08 11:55:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-09-08 11:55:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-08 11:55:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2019-09-08 11:55:21,298 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 67 [2019-09-08 11:55:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:21,299 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2019-09-08 11:55:21,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:55:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2019-09-08 11:55:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:55:21,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:21,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:21,305 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash -469367140, now seen corresponding path program 1 times [2019-09-08 11:55:21,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:21,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:21,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:21,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:21,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:21,456 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:55:21,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:21,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:55:21,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:55:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:55:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:55:21,460 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand 5 states. [2019-09-08 11:55:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:21,628 INFO L93 Difference]: Finished difference Result 331 states and 485 transitions. [2019-09-08 11:55:21,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:21,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 11:55:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:21,631 INFO L225 Difference]: With dead ends: 331 [2019-09-08 11:55:21,631 INFO L226 Difference]: Without dead ends: 186 [2019-09-08 11:55:21,632 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:55:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-08 11:55:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-09-08 11:55:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-08 11:55:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 261 transitions. [2019-09-08 11:55:21,662 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 261 transitions. Word has length 68 [2019-09-08 11:55:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:21,663 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 261 transitions. [2019-09-08 11:55:21,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:55:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 261 transitions. [2019-09-08 11:55:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:55:21,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:21,666 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] [2019-09-08 11:55:21,666 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 299075236, now seen corresponding path program 1 times [2019-09-08 11:55:21,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:21,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:21,820 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:55:21,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:21,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:55:21,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:55:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:55:21,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:55:21,823 INFO L87 Difference]: Start difference. First operand 186 states and 261 transitions. Second operand 6 states. [2019-09-08 11:55:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:22,044 INFO L93 Difference]: Finished difference Result 425 states and 623 transitions. [2019-09-08 11:55:22,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:22,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 11:55:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:22,047 INFO L225 Difference]: With dead ends: 425 [2019-09-08 11:55:22,047 INFO L226 Difference]: Without dead ends: 284 [2019-09-08 11:55:22,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:55:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-08 11:55:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2019-09-08 11:55:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 11:55:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 405 transitions. [2019-09-08 11:55:22,089 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 405 transitions. Word has length 69 [2019-09-08 11:55:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:22,089 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 405 transitions. [2019-09-08 11:55:22,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:55:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 405 transitions. [2019-09-08 11:55:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:55:22,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:22,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:22,096 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1045896819, now seen corresponding path program 1 times [2019-09-08 11:55:22,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:22,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:22,221 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:55:22,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:22,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:55:22,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:55:22,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:55:22,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:55:22,223 INFO L87 Difference]: Start difference. First operand 282 states and 405 transitions. Second operand 5 states. [2019-09-08 11:55:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:22,391 INFO L93 Difference]: Finished difference Result 527 states and 772 transitions. [2019-09-08 11:55:22,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:22,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-08 11:55:22,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:22,394 INFO L225 Difference]: With dead ends: 527 [2019-09-08 11:55:22,395 INFO L226 Difference]: Without dead ends: 282 [2019-09-08 11:55:22,400 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:55:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-08 11:55:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-08 11:55:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 11:55:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 400 transitions. [2019-09-08 11:55:22,426 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 400 transitions. Word has length 70 [2019-09-08 11:55:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:22,427 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 400 transitions. [2019-09-08 11:55:22,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:55:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 400 transitions. [2019-09-08 11:55:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:55:22,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:22,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:22,431 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1929984870, now seen corresponding path program 1 times [2019-09-08 11:55:22,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:22,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:22,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:22,551 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:55:22,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:22,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:55:22,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:55:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:55:22,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:55:22,554 INFO L87 Difference]: Start difference. First operand 282 states and 400 transitions. Second operand 5 states. [2019-09-08 11:55:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:22,700 INFO L93 Difference]: Finished difference Result 755 states and 1110 transitions. [2019-09-08 11:55:22,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:22,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:55:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:22,708 INFO L225 Difference]: With dead ends: 755 [2019-09-08 11:55:22,709 INFO L226 Difference]: Without dead ends: 563 [2019-09-08 11:55:22,711 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:55:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-08 11:55:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 376. [2019-09-08 11:55:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-08 11:55:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 543 transitions. [2019-09-08 11:55:22,768 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 543 transitions. Word has length 71 [2019-09-08 11:55:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:22,768 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 543 transitions. [2019-09-08 11:55:22,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:55:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 543 transitions. [2019-09-08 11:55:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:55:22,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:22,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:22,770 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:22,771 INFO L82 PathProgramCache]: Analyzing trace with hash -165846340, now seen corresponding path program 1 times [2019-09-08 11:55:22,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:22,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:22,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:22,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:22,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:22,868 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:55:22,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:22,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:55:22,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:55:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:55:22,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:55:22,871 INFO L87 Difference]: Start difference. First operand 376 states and 543 transitions. Second operand 5 states. [2019-09-08 11:55:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:23,010 INFO L93 Difference]: Finished difference Result 1019 states and 1513 transitions. [2019-09-08 11:55:23,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:23,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:55:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:23,015 INFO L225 Difference]: With dead ends: 1019 [2019-09-08 11:55:23,015 INFO L226 Difference]: Without dead ends: 728 [2019-09-08 11:55:23,016 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:55:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-08 11:55:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 598. [2019-09-08 11:55:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 11:55:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 881 transitions. [2019-09-08 11:55:23,067 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 881 transitions. Word has length 71 [2019-09-08 11:55:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:23,067 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 881 transitions. [2019-09-08 11:55:23,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:55:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 881 transitions. [2019-09-08 11:55:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:55:23,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:23,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:23,069 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:23,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:23,069 INFO L82 PathProgramCache]: Analyzing trace with hash -473955093, now seen corresponding path program 1 times [2019-09-08 11:55:23,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:23,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:23,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:23,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:23,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:23,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:55:23,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:23,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:55:23,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:55:23,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:55:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:55:23,166 INFO L87 Difference]: Start difference. First operand 598 states and 881 transitions. Second operand 5 states. [2019-09-08 11:55:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:23,316 INFO L93 Difference]: Finished difference Result 1298 states and 1938 transitions. [2019-09-08 11:55:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:23,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:55:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:23,323 INFO L225 Difference]: With dead ends: 1298 [2019-09-08 11:55:23,323 INFO L226 Difference]: Without dead ends: 809 [2019-09-08 11:55:23,325 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 11:55:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-09-08 11:55:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 698. [2019-09-08 11:55:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-09-08 11:55:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1033 transitions. [2019-09-08 11:55:23,410 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1033 transitions. Word has length 71 [2019-09-08 11:55:23,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:23,410 INFO L475 AbstractCegarLoop]: Abstraction has 698 states and 1033 transitions. [2019-09-08 11:55:23,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:55:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1033 transitions. [2019-09-08 11:55:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:55:23,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:23,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] [2019-09-08 11:55:23,412 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:23,413 INFO L82 PathProgramCache]: Analyzing trace with hash 500097299, now seen corresponding path program 1 times [2019-09-08 11:55:23,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:23,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:23,469 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:55:23,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:23,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:55:23,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:55:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:55:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:55:23,471 INFO L87 Difference]: Start difference. First operand 698 states and 1033 transitions. Second operand 3 states. [2019-09-08 11:55:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:23,616 INFO L93 Difference]: Finished difference Result 1798 states and 2679 transitions. [2019-09-08 11:55:23,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:55:23,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 11:55:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:23,623 INFO L225 Difference]: With dead ends: 1798 [2019-09-08 11:55:23,624 INFO L226 Difference]: Without dead ends: 1210 [2019-09-08 11:55:23,626 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:55:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-09-08 11:55:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1184. [2019-09-08 11:55:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-09-08 11:55:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1729 transitions. [2019-09-08 11:55:23,736 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1729 transitions. Word has length 71 [2019-09-08 11:55:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:23,736 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1729 transitions. [2019-09-08 11:55:23,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:55:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1729 transitions. [2019-09-08 11:55:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:55:23,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:23,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:23,738 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 671723250, now seen corresponding path program 1 times [2019-09-08 11:55:23,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:23,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:23,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:23,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:23,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:23,801 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:55:23,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:23,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:55:23,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:55:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:55:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:55:23,803 INFO L87 Difference]: Start difference. First operand 1184 states and 1729 transitions. Second operand 3 states. [2019-09-08 11:55:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:23,965 INFO L93 Difference]: Finished difference Result 2260 states and 3319 transitions. [2019-09-08 11:55:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:55:23,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 11:55:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:23,973 INFO L225 Difference]: With dead ends: 2260 [2019-09-08 11:55:23,973 INFO L226 Difference]: Without dead ends: 1186 [2019-09-08 11:55:23,978 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:55:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-09-08 11:55:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2019-09-08 11:55:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-09-08 11:55:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1725 transitions. [2019-09-08 11:55:24,113 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1725 transitions. Word has length 71 [2019-09-08 11:55:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:24,114 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1725 transitions. [2019-09-08 11:55:24,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:55:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1725 transitions. [2019-09-08 11:55:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:55:24,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:24,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:24,116 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:24,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:24,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1753966399, now seen corresponding path program 1 times [2019-09-08 11:55:24,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:24,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:24,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:24,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:24,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:24,217 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:55:24,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:24,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:55:24,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:55:24,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:55:24,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:55:24,219 INFO L87 Difference]: Start difference. First operand 1184 states and 1725 transitions. Second operand 5 states. [2019-09-08 11:55:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:24,481 INFO L93 Difference]: Finished difference Result 3811 states and 5595 transitions. [2019-09-08 11:55:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:55:24,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:55:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:24,495 INFO L225 Difference]: With dead ends: 3811 [2019-09-08 11:55:24,496 INFO L226 Difference]: Without dead ends: 2737 [2019-09-08 11:55:24,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 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 11:55:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2019-09-08 11:55:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2637. [2019-09-08 11:55:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-08 11:55:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3869 transitions. [2019-09-08 11:55:24,832 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3869 transitions. Word has length 71 [2019-09-08 11:55:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:24,833 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3869 transitions. [2019-09-08 11:55:24,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:55:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3869 transitions. [2019-09-08 11:55:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:55:24,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:24,835 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:24,836 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1515656525, now seen corresponding path program 1 times [2019-09-08 11:55:24,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:24,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:25,100 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:55:25,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:25,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:55:25,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:55:25,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:55:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:55:25,102 INFO L87 Difference]: Start difference. First operand 2637 states and 3869 transitions. Second operand 10 states. [2019-09-08 11:55:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:26,355 INFO L93 Difference]: Finished difference Result 7801 states and 11431 transitions. [2019-09-08 11:55:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:55:26,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 11:55:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:26,383 INFO L225 Difference]: With dead ends: 7801 [2019-09-08 11:55:26,383 INFO L226 Difference]: Without dead ends: 5287 [2019-09-08 11:55:26,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:55:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2019-09-08 11:55:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 2637. [2019-09-08 11:55:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-08 11:55:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3863 transitions. [2019-09-08 11:55:26,744 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3863 transitions. Word has length 72 [2019-09-08 11:55:26,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:26,745 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3863 transitions. [2019-09-08 11:55:26,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:55:26,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3863 transitions. [2019-09-08 11:55:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:55:26,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:26,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:26,747 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:26,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:26,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1460244248, now seen corresponding path program 1 times [2019-09-08 11:55:26,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:26,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:26,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:26,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:26,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:55:26,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:26,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:55:26,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:55:26,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:55:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:55:26,977 INFO L87 Difference]: Start difference. First operand 2637 states and 3863 transitions. Second operand 10 states. [2019-09-08 11:55:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:28,310 INFO L93 Difference]: Finished difference Result 7849 states and 11492 transitions. [2019-09-08 11:55:28,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:55:28,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-08 11:55:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:28,335 INFO L225 Difference]: With dead ends: 7849 [2019-09-08 11:55:28,335 INFO L226 Difference]: Without dead ends: 5302 [2019-09-08 11:55:28,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:55:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5302 states. [2019-09-08 11:55:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5302 to 2637. [2019-09-08 11:55:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-08 11:55:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3861 transitions. [2019-09-08 11:55:28,723 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3861 transitions. Word has length 73 [2019-09-08 11:55:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:28,724 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3861 transitions. [2019-09-08 11:55:28,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:55:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3861 transitions. [2019-09-08 11:55:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:55:28,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:28,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:28,728 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash 236126643, now seen corresponding path program 1 times [2019-09-08 11:55:28,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:28,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:28,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:28,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:28,977 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:55:28,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:28,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:55:28,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:55:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:55:28,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:55:28,981 INFO L87 Difference]: Start difference. First operand 2637 states and 3861 transitions. Second operand 9 states. [2019-09-08 11:55:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:29,867 INFO L93 Difference]: Finished difference Result 6459 states and 9488 transitions. [2019-09-08 11:55:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 11:55:29,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 11:55:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:29,888 INFO L225 Difference]: With dead ends: 6459 [2019-09-08 11:55:29,888 INFO L226 Difference]: Without dead ends: 3906 [2019-09-08 11:55:29,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:55:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-09-08 11:55:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 2637. [2019-09-08 11:55:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-08 11:55:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3860 transitions. [2019-09-08 11:55:30,370 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3860 transitions. Word has length 73 [2019-09-08 11:55:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:30,371 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3860 transitions. [2019-09-08 11:55:30,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:55:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3860 transitions. [2019-09-08 11:55:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:55:30,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:30,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:30,373 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:30,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1277245649, now seen corresponding path program 1 times [2019-09-08 11:55:30,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:30,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:30,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:30,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:30,606 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:55:30,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:30,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:55:30,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:55:30,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:55:30,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:55:30,607 INFO L87 Difference]: Start difference. First operand 2637 states and 3860 transitions. Second operand 10 states. [2019-09-08 11:55:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:32,068 INFO L93 Difference]: Finished difference Result 7834 states and 11465 transitions. [2019-09-08 11:55:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:55:32,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-08 11:55:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:32,091 INFO L225 Difference]: With dead ends: 7834 [2019-09-08 11:55:32,091 INFO L226 Difference]: Without dead ends: 5296 [2019-09-08 11:55:32,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:55:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-09-08 11:55:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 2637. [2019-09-08 11:55:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2637 states. [2019-09-08 11:55:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 3856 transitions. [2019-09-08 11:55:32,517 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 3856 transitions. Word has length 74 [2019-09-08 11:55:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:32,517 INFO L475 AbstractCegarLoop]: Abstraction has 2637 states and 3856 transitions. [2019-09-08 11:55:32,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:55:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 3856 transitions. [2019-09-08 11:55:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:55:32,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:32,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:32,520 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash -484955932, now seen corresponding path program 1 times [2019-09-08 11:55:32,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:32,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:32,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:33,322 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 11:55:34,374 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:55:34,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:34,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 11:55:34,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 11:55:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 11:55:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:55:34,376 INFO L87 Difference]: Start difference. First operand 2637 states and 3856 transitions. Second operand 23 states. [2019-09-08 11:55:34,548 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 11:55:35,369 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 11:55:35,634 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 11:55:35,944 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-09-08 11:55:36,341 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-09-08 11:55:36,893 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 118 [2019-09-08 11:55:37,540 WARN L188 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 139 [2019-09-08 11:55:37,847 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-08 11:55:38,156 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-09-08 11:55:38,376 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-09-08 11:55:38,771 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-08 11:55:39,885 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 11:55:40,225 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-08 11:55:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:45,743 INFO L93 Difference]: Finished difference Result 29155 states and 42930 transitions. [2019-09-08 11:55:45,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 11:55:45,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-09-08 11:55:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:45,798 INFO L225 Difference]: With dead ends: 29155 [2019-09-08 11:55:45,799 INFO L226 Difference]: Without dead ends: 26644 [2019-09-08 11:55:45,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 11:55:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26644 states. [2019-09-08 11:55:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26644 to 2672. [2019-09-08 11:55:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2672 states. [2019-09-08 11:55:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 3901 transitions. [2019-09-08 11:55:46,483 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 3901 transitions. Word has length 75 [2019-09-08 11:55:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:46,484 INFO L475 AbstractCegarLoop]: Abstraction has 2672 states and 3901 transitions. [2019-09-08 11:55:46,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 11:55:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3901 transitions. [2019-09-08 11:55:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:55:46,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:46,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:46,486 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1158728316, now seen corresponding path program 1 times [2019-09-08 11:55:46,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:46,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:55:48,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:48,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 11:55:48,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 11:55:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 11:55:48,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:55:48,128 INFO L87 Difference]: Start difference. First operand 2672 states and 3901 transitions. Second operand 24 states. [2019-09-08 11:55:48,284 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:55:48,694 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-08 11:55:48,967 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 11:55:49,122 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:55:49,443 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:55:49,695 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 11:55:49,979 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-08 11:55:50,343 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2019-09-08 11:55:50,789 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 103 [2019-09-08 11:55:51,470 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2019-09-08 11:55:51,725 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-08 11:55:51,976 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-08 11:55:52,232 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-08 11:55:52,810 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-08 11:55:53,237 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 11:55:53,503 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-08 11:55:53,894 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-08 11:55:55,728 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 11:55:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:57,747 INFO L93 Difference]: Finished difference Result 15332 states and 22551 transitions. [2019-09-08 11:55:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 11:55:57,747 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-08 11:55:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:57,776 INFO L225 Difference]: With dead ends: 15332 [2019-09-08 11:55:57,776 INFO L226 Difference]: Without dead ends: 12821 [2019-09-08 11:55:57,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=538, Invalid=2114, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 11:55:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12821 states. [2019-09-08 11:55:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12821 to 2684. [2019-09-08 11:55:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-09-08 11:55:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3912 transitions. [2019-09-08 11:55:58,443 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3912 transitions. Word has length 75 [2019-09-08 11:55:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:58,443 INFO L475 AbstractCegarLoop]: Abstraction has 2684 states and 3912 transitions. [2019-09-08 11:55:58,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 11:55:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3912 transitions. [2019-09-08 11:55:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:55:58,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:58,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:58,445 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash 671297890, now seen corresponding path program 1 times [2019-09-08 11:55:58,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:58,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:58,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:59,735 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:55:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 11:55:59,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 11:55:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 11:55:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:55:59,737 INFO L87 Difference]: Start difference. First operand 2684 states and 3912 transitions. Second operand 22 states. [2019-09-08 11:56:00,665 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 11:56:00,862 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-09-08 11:56:01,130 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 66 [2019-09-08 11:56:01,420 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-09-08 11:56:01,769 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 87 [2019-09-08 11:56:01,975 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 11:56:02,186 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 11:56:02,492 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-08 11:56:02,696 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-08 11:56:02,925 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-08 11:56:03,296 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 11:56:03,553 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 11:56:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:08,993 INFO L93 Difference]: Finished difference Result 14982 states and 22022 transitions. [2019-09-08 11:56:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:56:08,993 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2019-09-08 11:56:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:09,019 INFO L225 Difference]: With dead ends: 14982 [2019-09-08 11:56:09,019 INFO L226 Difference]: Without dead ends: 12450 [2019-09-08 11:56:09,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:56:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12450 states. [2019-09-08 11:56:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12450 to 2685. [2019-09-08 11:56:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2019-09-08 11:56:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3911 transitions. [2019-09-08 11:56:09,818 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3911 transitions. Word has length 75 [2019-09-08 11:56:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:09,818 INFO L475 AbstractCegarLoop]: Abstraction has 2685 states and 3911 transitions. [2019-09-08 11:56:09,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 11:56:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3911 transitions. [2019-09-08 11:56:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:56:09,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:09,820 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] [2019-09-08 11:56:09,820 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash -766941881, now seen corresponding path program 1 times [2019-09-08 11:56:09,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:09,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:09,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:09,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:09,909 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:56:09,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:09,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:56:09,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:56:09,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:56:09,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:56:09,911 INFO L87 Difference]: Start difference. First operand 2685 states and 3911 transitions. Second operand 4 states. [2019-09-08 11:56:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:10,772 INFO L93 Difference]: Finished difference Result 6324 states and 9284 transitions. [2019-09-08 11:56:10,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:56:10,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-08 11:56:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:10,778 INFO L225 Difference]: With dead ends: 6324 [2019-09-08 11:56:10,779 INFO L226 Difference]: Without dead ends: 3816 [2019-09-08 11:56:10,784 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:56:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2019-09-08 11:56:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3788. [2019-09-08 11:56:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2019-09-08 11:56:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5502 transitions. [2019-09-08 11:56:11,611 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5502 transitions. Word has length 76 [2019-09-08 11:56:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:11,612 INFO L475 AbstractCegarLoop]: Abstraction has 3788 states and 5502 transitions. [2019-09-08 11:56:11,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:56:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5502 transitions. [2019-09-08 11:56:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:56:11,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:11,613 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] [2019-09-08 11:56:11,613 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash 95389579, now seen corresponding path program 1 times [2019-09-08 11:56:11,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:11,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:11,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:11,683 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:56:11,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:11,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:56:11,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:56:11,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:56:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:56:11,685 INFO L87 Difference]: Start difference. First operand 3788 states and 5502 transitions. Second operand 5 states. [2019-09-08 11:56:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:13,147 INFO L93 Difference]: Finished difference Result 6065 states and 8800 transitions. [2019-09-08 11:56:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:56:13,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 11:56:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:13,155 INFO L225 Difference]: With dead ends: 6065 [2019-09-08 11:56:13,155 INFO L226 Difference]: Without dead ends: 6063 [2019-09-08 11:56:13,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:56:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2019-09-08 11:56:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3824. [2019-09-08 11:56:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3824 states. [2019-09-08 11:56:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5526 transitions. [2019-09-08 11:56:14,128 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5526 transitions. Word has length 76 [2019-09-08 11:56:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:14,128 INFO L475 AbstractCegarLoop]: Abstraction has 3824 states and 5526 transitions. [2019-09-08 11:56:14,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:56:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5526 transitions. [2019-09-08 11:56:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:56:14,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:14,130 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] [2019-09-08 11:56:14,130 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 318042292, now seen corresponding path program 1 times [2019-09-08 11:56:14,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:14,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:14,624 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:56:14,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:14,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:56:14,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:56:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:56:14,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:56:14,625 INFO L87 Difference]: Start difference. First operand 3824 states and 5526 transitions. Second operand 13 states. [2019-09-08 11:56:15,023 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-08 11:56:15,185 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 11:56:15,364 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 11:56:15,507 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-08 11:56:15,801 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-08 11:56:16,083 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-08 11:56:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:19,709 INFO L93 Difference]: Finished difference Result 16688 states and 24267 transitions. [2019-09-08 11:56:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:19,710 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-08 11:56:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:19,723 INFO L225 Difference]: With dead ends: 16688 [2019-09-08 11:56:19,723 INFO L226 Difference]: Without dead ends: 14598 [2019-09-08 11:56:19,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:56:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2019-09-08 11:56:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 3785. [2019-09-08 11:56:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3785 states. [2019-09-08 11:56:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5475 transitions. [2019-09-08 11:56:20,807 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5475 transitions. Word has length 76 [2019-09-08 11:56:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:20,807 INFO L475 AbstractCegarLoop]: Abstraction has 3785 states and 5475 transitions. [2019-09-08 11:56:20,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:56:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5475 transitions. [2019-09-08 11:56:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:56:20,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:20,809 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] [2019-09-08 11:56:20,809 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:20,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1249654324, now seen corresponding path program 1 times [2019-09-08 11:56:20,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:20,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:20,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:20,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:20,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:21,698 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:56:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 11:56:21,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 11:56:21,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 11:56:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:56:21,700 INFO L87 Difference]: Start difference. First operand 3785 states and 5475 transitions. Second operand 18 states. [2019-09-08 11:56:22,413 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 11:56:22,626 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-08 11:56:22,865 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-08 11:56:23,020 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:56:23,443 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:56:23,595 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 11:56:23,812 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 11:56:24,082 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 11:56:24,328 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-08 11:56:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:31,661 INFO L93 Difference]: Finished difference Result 29036 states and 42273 transitions. [2019-09-08 11:56:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:56:31,664 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2019-09-08 11:56:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:31,688 INFO L225 Difference]: With dead ends: 29036 [2019-09-08 11:56:31,688 INFO L226 Difference]: Without dead ends: 25457 [2019-09-08 11:56:31,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 11:56:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25457 states. [2019-09-08 11:56:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25457 to 3774. [2019-09-08 11:56:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2019-09-08 11:56:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 5461 transitions. [2019-09-08 11:56:33,455 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 5461 transitions. Word has length 76 [2019-09-08 11:56:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:33,455 INFO L475 AbstractCegarLoop]: Abstraction has 3774 states and 5461 transitions. [2019-09-08 11:56:33,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 11:56:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 5461 transitions. [2019-09-08 11:56:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:56:33,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:33,456 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] [2019-09-08 11:56:33,456 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:33,456 INFO L82 PathProgramCache]: Analyzing trace with hash 58971285, now seen corresponding path program 1 times [2019-09-08 11:56:33,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:33,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:33,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:33,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:33,901 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:56:33,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:33,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:56:33,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:56:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:56:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:56:33,902 INFO L87 Difference]: Start difference. First operand 3774 states and 5461 transitions. Second operand 13 states. [2019-09-08 11:56:34,326 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-08 11:56:34,491 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:56:34,661 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 11:56:34,980 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-08 11:56:35,214 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-08 11:56:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:39,707 INFO L93 Difference]: Finished difference Result 18324 states and 26660 transitions. [2019-09-08 11:56:39,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:56:39,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-08 11:56:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:39,723 INFO L225 Difference]: With dead ends: 18324 [2019-09-08 11:56:39,724 INFO L226 Difference]: Without dead ends: 14749 [2019-09-08 11:56:39,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:56:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14749 states. [2019-09-08 11:56:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14749 to 3757. [2019-09-08 11:56:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-09-08 11:56:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 5439 transitions. [2019-09-08 11:56:40,942 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 5439 transitions. Word has length 76 [2019-09-08 11:56:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:40,942 INFO L475 AbstractCegarLoop]: Abstraction has 3757 states and 5439 transitions. [2019-09-08 11:56:40,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:56:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 5439 transitions. [2019-09-08 11:56:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:56:40,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:40,943 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] [2019-09-08 11:56:40,943 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash -105565103, now seen corresponding path program 1 times [2019-09-08 11:56:40,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:40,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:41,603 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:56:41,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:41,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:56:41,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:56:41,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:56:41,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:56:41,604 INFO L87 Difference]: Start difference. First operand 3757 states and 5439 transitions. Second operand 16 states. [2019-09-08 11:56:42,291 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-08 11:56:42,438 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:56:42,589 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 11:56:42,818 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 11:56:42,948 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 11:56:43,162 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 11:56:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:51,153 INFO L93 Difference]: Finished difference Result 24727 states and 36009 transitions. [2019-09-08 11:56:51,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:56:51,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-09-08 11:56:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:51,172 INFO L225 Difference]: With dead ends: 24727 [2019-09-08 11:56:51,173 INFO L226 Difference]: Without dead ends: 21067 [2019-09-08 11:56:51,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:56:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21067 states. [2019-09-08 11:56:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21067 to 3753. [2019-09-08 11:56:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2019-09-08 11:56:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 5434 transitions. [2019-09-08 11:56:52,447 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 5434 transitions. Word has length 76 [2019-09-08 11:56:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:52,447 INFO L475 AbstractCegarLoop]: Abstraction has 3753 states and 5434 transitions. [2019-09-08 11:56:52,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:56:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 5434 transitions. [2019-09-08 11:56:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:56:52,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:52,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:56:52,448 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1372189360, now seen corresponding path program 1 times [2019-09-08 11:56:52,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:52,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:52,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:52,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:53,092 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:56:53,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:53,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:56:53,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:56:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:56:53,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:56:53,093 INFO L87 Difference]: Start difference. First operand 3753 states and 5434 transitions. Second operand 14 states. [2019-09-08 11:56:53,729 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 11:56:53,913 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 11:56:54,124 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 11:56:54,304 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 11:56:54,476 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:56:54,658 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:56:54,871 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-08 11:56:55,012 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:56:55,190 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 11:56:55,995 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-08 11:57:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:03,308 INFO L93 Difference]: Finished difference Result 25569 states and 37231 transitions. [2019-09-08 11:57:03,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:57:03,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-09-08 11:57:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:03,329 INFO L225 Difference]: With dead ends: 25569 [2019-09-08 11:57:03,329 INFO L226 Difference]: Without dead ends: 22005 [2019-09-08 11:57:03,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:57:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22005 states. [2019-09-08 11:57:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22005 to 3737. [2019-09-08 11:57:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3737 states. [2019-09-08 11:57:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5413 transitions. [2019-09-08 11:57:04,734 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 5413 transitions. Word has length 76 [2019-09-08 11:57:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:04,734 INFO L475 AbstractCegarLoop]: Abstraction has 3737 states and 5413 transitions. [2019-09-08 11:57:04,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:57:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 5413 transitions. [2019-09-08 11:57:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:57:04,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:04,735 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:57:04,735 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:04,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash 508032095, now seen corresponding path program 1 times [2019-09-08 11:57:04,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:04,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:05,334 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-08 11:57:05,719 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-08 11:57:06,242 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 11:57:06,772 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:06,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:06,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 11:57:06,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 11:57:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 11:57:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:57:06,774 INFO L87 Difference]: Start difference. First operand 3737 states and 5413 transitions. Second operand 25 states. [2019-09-08 11:57:07,373 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-08 11:57:07,831 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-08 11:57:08,042 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 11:57:08,279 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 11:57:08,566 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 11:57:08,888 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-09-08 11:57:09,348 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 102 [2019-09-08 11:57:09,635 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:57:09,890 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 11:57:10,067 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:57:10,314 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-09-08 11:57:10,600 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-08 11:57:10,851 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-08 11:57:11,164 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-08 11:57:11,380 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-08 11:57:11,598 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 11:57:11,849 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-08 11:57:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:36,217 INFO L93 Difference]: Finished difference Result 54235 states and 79022 transitions. [2019-09-08 11:57:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 11:57:36,218 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-08 11:57:36,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:36,271 INFO L225 Difference]: With dead ends: 54235 [2019-09-08 11:57:36,272 INFO L226 Difference]: Without dead ends: 50587 [2019-09-08 11:57:36,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=483, Invalid=2273, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 11:57:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50587 states. [2019-09-08 11:57:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50587 to 3741. [2019-09-08 11:57:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3741 states. [2019-09-08 11:57:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5417 transitions. [2019-09-08 11:57:38,139 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5417 transitions. Word has length 77 [2019-09-08 11:57:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:38,139 INFO L475 AbstractCegarLoop]: Abstraction has 3741 states and 5417 transitions. [2019-09-08 11:57:38,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 11:57:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5417 transitions. [2019-09-08 11:57:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:57:38,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:38,140 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] [2019-09-08 11:57:38,141 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash 127485420, now seen corresponding path program 1 times [2019-09-08 11:57:38,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:38,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:38,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:38,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:38,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:38,745 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:38,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:38,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:57:38,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:57:38,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:57:38,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:57:38,746 INFO L87 Difference]: Start difference. First operand 3741 states and 5417 transitions. Second operand 12 states. [2019-09-08 11:57:39,219 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:57:39,390 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 11:57:39,571 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 11:57:39,718 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:57:39,895 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 11:57:40,031 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 11:57:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:45,136 INFO L93 Difference]: Finished difference Result 14486 states and 21057 transitions. [2019-09-08 11:57:45,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:57:45,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2019-09-08 11:57:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:45,145 INFO L225 Difference]: With dead ends: 14486 [2019-09-08 11:57:45,146 INFO L226 Difference]: Without dead ends: 10818 [2019-09-08 11:57:45,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:57:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2019-09-08 11:57:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 3635. [2019-09-08 11:57:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2019-09-08 11:57:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 5270 transitions. [2019-09-08 11:57:46,761 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 5270 transitions. Word has length 78 [2019-09-08 11:57:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:46,761 INFO L475 AbstractCegarLoop]: Abstraction has 3635 states and 5270 transitions. [2019-09-08 11:57:46,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:57:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 5270 transitions. [2019-09-08 11:57:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:57:46,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:46,763 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:57:46,763 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash -607662036, now seen corresponding path program 1 times [2019-09-08 11:57:46,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:46,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:46,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:46,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:46,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:46,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:46,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:46,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:46,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:46,823 INFO L87 Difference]: Start difference. First operand 3635 states and 5270 transitions. Second operand 3 states. [2019-09-08 11:57:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:50,696 INFO L93 Difference]: Finished difference Result 10439 states and 15096 transitions. [2019-09-08 11:57:50,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:50,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:57:50,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:50,703 INFO L225 Difference]: With dead ends: 10439 [2019-09-08 11:57:50,703 INFO L226 Difference]: Without dead ends: 6877 [2019-09-08 11:57:50,708 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:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2019-09-08 11:57:53,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 6555. [2019-09-08 11:57:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6555 states. [2019-09-08 11:57:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6555 states to 6555 states and 9422 transitions. [2019-09-08 11:57:53,661 INFO L78 Accepts]: Start accepts. Automaton has 6555 states and 9422 transitions. Word has length 101 [2019-09-08 11:57:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:53,662 INFO L475 AbstractCegarLoop]: Abstraction has 6555 states and 9422 transitions. [2019-09-08 11:57:53,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:57:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6555 states and 9422 transitions. [2019-09-08 11:57:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:57:53,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:53,663 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:57:53,663 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash 59337062, now seen corresponding path program 1 times [2019-09-08 11:57:53,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:53,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:53,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:53,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:57:53,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:57:53,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:57:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:57:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:57:53,711 INFO L87 Difference]: Start difference. First operand 6555 states and 9422 transitions. Second operand 3 states. [2019-09-08 11:57:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:58,136 INFO L93 Difference]: Finished difference Result 13821 states and 19926 transitions. [2019-09-08 11:57:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:57:58,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:57:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:58,143 INFO L225 Difference]: With dead ends: 13821 [2019-09-08 11:57:58,144 INFO L226 Difference]: Without dead ends: 9181 [2019-09-08 11:57:58,149 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,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9181 states. [2019-09-08 11:58:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9181 to 8755. [2019-09-08 11:58:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-09-08 11:58:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 12554 transitions. [2019-09-08 11:58:02,097 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 12554 transitions. Word has length 102 [2019-09-08 11:58:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:02,097 INFO L475 AbstractCegarLoop]: Abstraction has 8755 states and 12554 transitions. [2019-09-08 11:58:02,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:58:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 12554 transitions. [2019-09-08 11:58:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:58:02,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:02,098 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:58:02,098 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1237399417, now seen corresponding path program 1 times [2019-09-08 11:58:02,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:02,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:02,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:02,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:02,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:02,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:02,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:02,148 INFO L87 Difference]: Start difference. First operand 8755 states and 12554 transitions. Second operand 5 states. [2019-09-08 11:58:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:11,449 INFO L93 Difference]: Finished difference Result 27927 states and 39854 transitions. [2019-09-08 11:58:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:58:11,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:58:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:11,468 INFO L225 Difference]: With dead ends: 27927 [2019-09-08 11:58:11,468 INFO L226 Difference]: Without dead ends: 19261 [2019-09-08 11:58:11,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19261 states. [2019-09-08 11:58:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19261 to 9295. [2019-09-08 11:58:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9295 states. [2019-09-08 11:58:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9295 states to 9295 states and 13094 transitions. [2019-09-08 11:58:15,742 INFO L78 Accepts]: Start accepts. Automaton has 9295 states and 13094 transitions. Word has length 102 [2019-09-08 11:58:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:15,742 INFO L475 AbstractCegarLoop]: Abstraction has 9295 states and 13094 transitions. [2019-09-08 11:58:15,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9295 states and 13094 transitions. [2019-09-08 11:58:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:58:15,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:15,743 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:58:15,743 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:15,744 INFO L82 PathProgramCache]: Analyzing trace with hash 48673997, now seen corresponding path program 1 times [2019-09-08 11:58:15,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:15,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:15,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:15,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:15,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:15,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:15,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:15,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:15,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:15,797 INFO L87 Difference]: Start difference. First operand 9295 states and 13094 transitions. Second operand 5 states. [2019-09-08 11:58:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:33,078 INFO L93 Difference]: Finished difference Result 45687 states and 63802 transitions. [2019-09-08 11:58:33,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:58:33,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:58:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:33,119 INFO L225 Difference]: With dead ends: 45687 [2019-09-08 11:58:33,119 INFO L226 Difference]: Without dead ends: 36481 [2019-09-08 11:58:33,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36481 states. [2019-09-08 11:58:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36481 to 19363. [2019-09-08 11:58:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19363 states. [2019-09-08 11:58:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19363 states to 19363 states and 26958 transitions. [2019-09-08 11:58:41,931 INFO L78 Accepts]: Start accepts. Automaton has 19363 states and 26958 transitions. Word has length 102 [2019-09-08 11:58:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:41,931 INFO L475 AbstractCegarLoop]: Abstraction has 19363 states and 26958 transitions. [2019-09-08 11:58:41,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19363 states and 26958 transitions. [2019-09-08 11:58:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:58:41,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:41,935 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:58:41,936 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash -598394706, now seen corresponding path program 1 times [2019-09-08 11:58:41,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:41,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:41,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:41,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:58:41,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:58:41,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:58:41,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:58:41,990 INFO L87 Difference]: Start difference. First operand 19363 states and 26958 transitions. Second operand 3 states. [2019-09-08 11:58:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:58,970 INFO L93 Difference]: Finished difference Result 55751 states and 77232 transitions. [2019-09-08 11:58:58,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:58:58,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:58:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:59,009 INFO L225 Difference]: With dead ends: 55751 [2019-09-08 11:58:59,009 INFO L226 Difference]: Without dead ends: 36477 [2019-09-08 11:58:59,024 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:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36477 states. [2019-09-08 11:59:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36477 to 26083. [2019-09-08 11:59:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26083 states. [2019-09-08 11:59:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26083 states to 26083 states and 35530 transitions. [2019-09-08 11:59:10,625 INFO L78 Accepts]: Start accepts. Automaton has 26083 states and 35530 transitions. Word has length 126 [2019-09-08 11:59:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:10,625 INFO L475 AbstractCegarLoop]: Abstraction has 26083 states and 35530 transitions. [2019-09-08 11:59:10,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26083 states and 35530 transitions. [2019-09-08 11:59:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:59:10,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:10,630 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:59:10,631 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:10,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash 62618520, now seen corresponding path program 1 times [2019-09-08 11:59:10,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:10,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:10,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:10,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:10,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:10,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:59:10,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:59:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:59:10,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:59:10,685 INFO L87 Difference]: Start difference. First operand 26083 states and 35530 transitions. Second operand 3 states. [2019-09-08 11:59:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:25,148 INFO L93 Difference]: Finished difference Result 57503 states and 78028 transitions. [2019-09-08 11:59:25,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:59:25,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 11:59:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:25,197 INFO L225 Difference]: With dead ends: 57503 [2019-09-08 11:59:25,197 INFO L226 Difference]: Without dead ends: 31509 [2019-09-08 11:59:25,227 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:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31509 states. [2019-09-08 11:59:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31509 to 29779. [2019-09-08 11:59:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29779 states. [2019-09-08 11:59:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29779 states to 29779 states and 40214 transitions. [2019-09-08 11:59:39,197 INFO L78 Accepts]: Start accepts. Automaton has 29779 states and 40214 transitions. Word has length 127 [2019-09-08 11:59:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:39,198 INFO L475 AbstractCegarLoop]: Abstraction has 29779 states and 40214 transitions. [2019-09-08 11:59:39,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:59:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 29779 states and 40214 transitions. [2019-09-08 11:59:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:59:39,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:39,203 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-08 11:59:39,203 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:39,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1530675729, now seen corresponding path program 1 times [2019-09-08 11:59:39,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:39,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:39,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:39,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:39,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:39,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:59:39,447 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 11:59:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:39,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 11:59:39,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:59:39,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:59:40,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:59:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 11:59:40,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:59:40,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-08 11:59:40,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:59:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:59:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:59:40,479 INFO L87 Difference]: Start difference. First operand 29779 states and 40214 transitions. Second operand 20 states. [2019-09-08 11:59:40,793 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 11:59:41,334 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 11:59:41,916 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:59:42,249 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-08 11:59:42,689 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:59:42,916 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:59:43,172 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:59:43,422 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:59:43,637 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:59:43,831 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:59:44,338 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 11:59:44,735 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 11:59:45,455 WARN L188 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:59:45,683 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:59:46,123 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:59:46,533 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 11:59:46,847 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 11:59:47,276 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 11:59:47,516 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 11:59:47,820 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 11:59:48,362 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 11:59:48,820 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-08 11:59:49,063 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:59:49,282 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:59:49,625 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 11:59:49,923 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 11:59:50,320 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 11:59:50,573 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:59:50,928 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-08 11:59:51,320 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 11:59:51,704 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-08 11:59:52,084 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-08 11:59:52,413 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:59:52,609 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 11:59:52,933 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-08 11:59:53,404 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-08 11:59:53,901 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-08 11:59:54,551 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 11:59:54,794 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 11:59:55,070 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 11:59:55,489 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-08 11:59:55,766 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-08 11:59:56,004 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:59:56,201 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 11:59:56,471 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 11:59:56,747 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-08 11:59:57,209 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:59:57,574 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 11:59:58,159 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 11:59:58,697 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-08 11:59:59,193 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 11:59:59,482 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:59:59,838 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-08 12:00:00,128 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:00:00,577 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 12:00:00,938 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-08 12:00:01,345 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:00:01,790 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:00:02,072 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 12:00:02,502 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:00:02,807 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-08 12:00:03,132 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:00:03,420 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 12:00:03,950 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:00:04,174 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 12:00:04,562 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-08 12:00:04,825 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:00:05,110 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:00:05,463 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:00:05,698 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 12:00:06,161 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 12:00:07,404 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 12:00:07,804 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 12:00:08,374 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-08 12:00:08,756 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-08 12:00:09,216 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 12:00:09,547 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 12:00:10,035 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 12:00:10,472 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 12:00:10,849 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:00:11,225 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:00:11,598 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 12:00:12,082 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2019-09-08 12:00:12,503 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:00:12,900 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-08 12:00:13,326 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-08 12:00:13,890 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-08 12:00:14,332 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-08 12:00:14,710 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-08 12:00:15,062 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 12:00:15,350 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 12:00:15,617 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 12:00:16,036 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-08 12:00:16,607 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-08 12:00:17,021 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:00:17,400 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-08 12:00:17,685 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 12:00:18,178 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:00:18,515 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-08 12:00:18,888 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 12:00:19,437 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:00:19,911 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:00:20,302 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2019-09-08 12:00:20,872 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:00:21,307 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:00:21,637 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-08 12:00:21,996 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:00:22,332 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-08 12:00:22,795 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:00:23,156 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:00:23,619 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-08 12:00:23,893 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:00:24,254 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-08 12:00:24,743 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:00:25,061 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:00:25,438 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-08 12:00:25,821 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:00:26,526 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 12:00:26,866 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:00:27,139 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-08 12:00:27,465 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-08 12:00:27,746 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:00:28,056 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:00:28,632 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-08 12:00:28,984 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-08 12:00:29,343 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-08 12:00:29,699 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:00:30,112 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:00:30,523 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:00:30,925 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:00:31,224 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:00:31,697 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-08 12:00:32,293 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:00:32,662 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-08 12:00:33,026 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-08 12:00:33,418 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-08 12:00:33,740 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-08 12:00:34,207 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:00:34,485 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:00:34,995 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 12:00:35,282 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:00:35,737 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 12:00:36,155 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:00:36,570 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:00:36,911 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:00:37,313 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:00:37,766 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:00:38,270 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-09-08 12:00:38,573 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 12:00:39,074 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-09-08 12:00:39,582 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:00:40,032 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 12:00:40,306 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 12:00:40,782 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 12:00:41,143 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 12:00:41,516 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-08 12:00:41,999 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-08 12:00:42,261 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:00:42,683 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-08 12:00:43,082 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-08 12:00:43,516 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-09-08 12:00:43,984 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:00:44,414 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-08 12:00:44,902 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-08 12:00:45,274 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:00:45,636 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:00:46,183 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 12:00:46,690 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 12:00:47,127 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:00:47,551 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-09-08 12:00:48,061 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-08 12:00:48,582 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:00:49,002 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-08 12:00:49,370 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:00:50,043 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-09-08 12:00:50,294 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:00:50,618 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-08 12:00:50,904 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 12:00:51,804 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:00:52,372 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:00:52,803 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-09-08 12:00:53,166 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:00:54,372 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:00:55,800 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 12:00:56,345 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-08 12:00:57,629 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:00:57,972 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:00:58,341 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-08 12:00:58,660 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:00:59,044 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:00:59,578 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:01:00,324 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:01:01,224 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 12:01:01,748 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-08 12:01:02,076 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-08 12:01:02,366 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-08 12:01:03,562 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:01:04,127 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-08 12:01:04,535 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-08 12:01:04,874 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-09-08 12:01:05,456 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 12:01:05,833 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:01:06,221 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-09-08 12:01:06,610 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:01:06,971 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:01:07,391 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:01:07,921 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-08 12:01:08,280 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-08 12:01:09,168 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:01:09,391 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 12:01:10,041 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:01:10,269 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:01:10,561 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:01:11,151 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-08 12:01:11,507 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:01:11,952 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-09-08 12:01:12,271 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 12:01:12,867 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-08 12:01:13,355 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:01:13,760 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:01:14,305 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:01:14,568 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:01:14,853 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 12:01:15,424 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 12:01:16,121 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:01:16,613 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:01:17,350 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-08 12:01:17,654 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:01:17,991 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:01:18,613 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:01:19,020 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:01:19,529 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:01:20,005 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:01:20,485 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:01:21,062 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 12:01:21,512 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:01:22,450 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 12:01:28,560 WARN L188 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-08 12:01:31,764 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-08 12:04:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:39,357 INFO L93 Difference]: Finished difference Result 372825 states and 493736 transitions. [2019-09-08 12:04:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-09-08 12:04:39,358 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2019-09-08 12:04:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:40,513 INFO L225 Difference]: With dead ends: 372825 [2019-09-08 12:04:40,513 INFO L226 Difference]: Without dead ends: 343135 [2019-09-08 12:04:40,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28669 ImplicationChecksByTransitivity, 81.9s TimeCoverageRelationStatistics Valid=9268, Invalid=59114, Unknown=0, NotChecked=0, Total=68382 [2019-09-08 12:04:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343135 states. [2019-09-08 12:05:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343135 to 117100. [2019-09-08 12:05:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117100 states. [2019-09-08 12:05:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117100 states to 117100 states and 156770 transitions. [2019-09-08 12:05:54,942 INFO L78 Accepts]: Start accepts. Automaton has 117100 states and 156770 transitions. Word has length 128 [2019-09-08 12:05:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:54,942 INFO L475 AbstractCegarLoop]: Abstraction has 117100 states and 156770 transitions. [2019-09-08 12:05:54,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:05:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 117100 states and 156770 transitions. [2019-09-08 12:05:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:05:54,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:54,953 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:05:54,953 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1144567600, now seen corresponding path program 1 times [2019-09-08 12:05:54,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:54,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:54,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:54,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:54,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:05:55,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:55,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:05:55,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:05:55,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:05:55,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:05:55,029 INFO L87 Difference]: Start difference. First operand 117100 states and 156770 transitions. Second operand 3 states. [2019-09-08 12:06:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:48,808 INFO L93 Difference]: Finished difference Result 202173 states and 271696 transitions. [2019-09-08 12:06:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:06:48,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 12:06:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:48,944 INFO L225 Difference]: With dead ends: 202173 [2019-09-08 12:06:48,945 INFO L226 Difference]: Without dead ends: 85195 [2019-09-08 12:06:49,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:06:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85195 states. [2019-09-08 12:07:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85195 to 82769. [2019-09-08 12:07:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82769 states. [2019-09-08 12:07:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82769 states to 82769 states and 109955 transitions. [2019-09-08 12:07:38,701 INFO L78 Accepts]: Start accepts. Automaton has 82769 states and 109955 transitions. Word has length 128 [2019-09-08 12:07:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:07:38,701 INFO L475 AbstractCegarLoop]: Abstraction has 82769 states and 109955 transitions. [2019-09-08 12:07:38,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:07:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 82769 states and 109955 transitions. [2019-09-08 12:07:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 12:07:38,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:07:38,706 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,706 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:07:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:07:38,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2106495891, now seen corresponding path program 1 times [2019-09-08 12:07:38,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:07:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:07:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:38,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:07:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:38,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:07:38,981 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:07:38,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:07:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:07:39,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 12:07:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:07:39,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:07:39,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:07:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:07:39,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:07:39,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-09-08 12:07:39,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:07:39,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:07:39,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:07:39,648 INFO L87 Difference]: Start difference. First operand 82769 states and 109955 transitions. Second operand 20 states. [2019-09-08 12:07:39,862 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 12:07:40,187 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-08 12:07:40,840 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:07:41,252 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:07:41,918 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:07:42,247 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:07:42,758 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:07:43,417 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:07:44,018 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:07:44,403 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:07:44,781 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:07:45,131 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:07:45,349 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:07:45,729 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:07:47,479 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:07:47,968 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 12:07:58,355 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:07:58,620 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:07:58,904 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:08:03,629 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:08:05,546 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69