java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:57:02,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:57:02,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:57:02,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:57:02,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:57:02,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:57:02,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:57:02,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:57:02,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:57:02,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:57:02,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:57:02,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:57:02,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:57:02,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:57:02,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:57:02,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:57:02,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:57:02,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:57:02,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:57:02,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:57:02,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:57:02,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:57:02,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:57:02,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:57:02,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:57:02,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:57:02,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:57:02,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:57:02,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:57:02,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:57:02,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:57:02,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:57:02,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:57:02,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:57:02,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:57:02,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:57:02,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:57:02,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:57:02,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:57:02,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:57:02,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:57:02,349 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-10-02 14:57:02,364 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:57:02,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:57:02,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:57:02,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:57:02,365 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:57:02,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:57:02,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:57:02,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:57:02,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:57:02,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:57:02,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:57:02,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:57:02,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:57:02,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:57:02,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:57:02,368 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:57:02,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:57:02,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:57:02,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:57:02,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:57:02,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:57:02,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:57:02,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:57:02,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:57:02,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:57:02,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:57:02,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:57:02,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:57:02,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:57:02,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:57:02,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:57:02,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:57:02,414 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:57:02,414 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:57:02,415 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 14:57:02,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a52e71e/d25e76bc42fa4ce8a42cd7f552e6c610/FLAGab9882803 [2019-10-02 14:57:03,001 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:57:03,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 14:57:03,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a52e71e/d25e76bc42fa4ce8a42cd7f552e6c610/FLAGab9882803 [2019-10-02 14:57:03,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a52e71e/d25e76bc42fa4ce8a42cd7f552e6c610 [2019-10-02 14:57:03,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:57:03,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:57:03,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:57:03,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:57:03,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:57:03,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169dc683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03, skipping insertion in model container [2019-10-02 14:57:03,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,302 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:57:03,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:57:03,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:57:03,726 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:57:03,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:57:03,827 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:57:03,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03 WrapperNode [2019-10-02 14:57:03,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:57:03,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:57:03,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:57:03,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:57:03,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (1/1) ... [2019-10-02 14:57:03,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:57:03,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:57:03,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:57:03,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:57:03,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (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-10-02 14:57:03,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:57:03,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:57:03,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:57:03,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:57:03,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:57:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:57:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 14:57:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:57:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:57:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:57:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:57:03,963 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:57:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:57:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:57:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:57:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:57:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:57:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:57:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:57:04,763 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:57:04,763 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:57:04,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:57:04 BoogieIcfgContainer [2019-10-02 14:57:04,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:57:04,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:57:04,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:57:04,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:57:04,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:57:03" (1/3) ... [2019-10-02 14:57:04,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4075567a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:57:04, skipping insertion in model container [2019-10-02 14:57:04,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:57:03" (2/3) ... [2019-10-02 14:57:04,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4075567a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:57:04, skipping insertion in model container [2019-10-02 14:57:04,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:57:04" (3/3) ... [2019-10-02 14:57:04,775 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-02 14:57:04,784 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:57:04,793 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:57:04,809 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:57:04,838 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:57:04,839 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:57:04,839 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:57:04,839 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:57:04,840 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:57:04,840 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:57:04,840 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:57:04,840 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:57:04,840 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:57:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-10-02 14:57:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:57:04,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:04,871 INFO L411 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] [2019-10-02 14:57:04,873 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash -276696918, now seen corresponding path program 1 times [2019-10-02 14:57:04,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:04,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:04,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:04,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:04,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:05,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:05,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:05,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:05,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:05,345 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 6 states. [2019-10-02 14:57:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:05,801 INFO L93 Difference]: Finished difference Result 721 states and 1142 transitions. [2019-10-02 14:57:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:57:05,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-02 14:57:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:05,834 INFO L225 Difference]: With dead ends: 721 [2019-10-02 14:57:05,834 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 14:57:05,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:57:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 14:57:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 423. [2019-10-02 14:57:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-02 14:57:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-10-02 14:57:05,995 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 52 [2019-10-02 14:57:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:05,996 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-10-02 14:57:05,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-10-02 14:57:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:57:06,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:06,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:06,000 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1087729035, now seen corresponding path program 1 times [2019-10-02 14:57:06,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:06,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:06,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:06,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:06,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:06,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:06,156 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 3 states. [2019-10-02 14:57:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:06,226 INFO L93 Difference]: Finished difference Result 1104 states and 1713 transitions. [2019-10-02 14:57:06,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:06,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 14:57:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:06,234 INFO L225 Difference]: With dead ends: 1104 [2019-10-02 14:57:06,234 INFO L226 Difference]: Without dead ends: 748 [2019-10-02 14:57:06,240 INFO L640 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-10-02 14:57:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-02 14:57:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-10-02 14:57:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-02 14:57:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1138 transitions. [2019-10-02 14:57:06,281 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1138 transitions. Word has length 55 [2019-10-02 14:57:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:06,282 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1138 transitions. [2019-10-02 14:57:06,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1138 transitions. [2019-10-02 14:57:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:57:06,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:06,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:06,293 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:06,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash 917757431, now seen corresponding path program 1 times [2019-10-02 14:57:06,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:06,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:06,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:06,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:06,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:06,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:06,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:06,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:06,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:06,431 INFO L87 Difference]: Start difference. First operand 746 states and 1138 transitions. Second operand 3 states. [2019-10-02 14:57:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:06,519 INFO L93 Difference]: Finished difference Result 2006 states and 3079 transitions. [2019-10-02 14:57:06,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:06,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 14:57:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:06,538 INFO L225 Difference]: With dead ends: 2006 [2019-10-02 14:57:06,539 INFO L226 Difference]: Without dead ends: 1335 [2019-10-02 14:57:06,541 INFO L640 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-10-02 14:57:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-02 14:57:06,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1333. [2019-10-02 14:57:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-02 14:57:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2001 transitions. [2019-10-02 14:57:06,652 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2001 transitions. Word has length 55 [2019-10-02 14:57:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:06,655 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 2001 transitions. [2019-10-02 14:57:06,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2001 transitions. [2019-10-02 14:57:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:57:06,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:06,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:06,657 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:06,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash -41555275, now seen corresponding path program 1 times [2019-10-02 14:57:06,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:06,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:06,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:06,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:06,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:06,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:57:06,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:57:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:57:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:57:06,845 INFO L87 Difference]: Start difference. First operand 1333 states and 2001 transitions. Second operand 10 states. [2019-10-02 14:57:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:08,736 INFO L93 Difference]: Finished difference Result 7842 states and 11792 transitions. [2019-10-02 14:57:08,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:57:08,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-02 14:57:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:08,782 INFO L225 Difference]: With dead ends: 7842 [2019-10-02 14:57:08,782 INFO L226 Difference]: Without dead ends: 7341 [2019-10-02 14:57:08,785 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:57:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7341 states. [2019-10-02 14:57:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7341 to 1358. [2019-10-02 14:57:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-10-02 14:57:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2033 transitions. [2019-10-02 14:57:08,992 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2033 transitions. Word has length 56 [2019-10-02 14:57:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:08,992 INFO L475 AbstractCegarLoop]: Abstraction has 1358 states and 2033 transitions. [2019-10-02 14:57:08,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:57:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2033 transitions. [2019-10-02 14:57:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:57:08,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:08,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:08,996 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash -742667424, now seen corresponding path program 1 times [2019-10-02 14:57:08,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:08,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:09,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:09,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:09,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:09,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:57:09,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:57:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:57:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:09,141 INFO L87 Difference]: Start difference. First operand 1358 states and 2033 transitions. Second operand 7 states. [2019-10-02 14:57:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:10,098 INFO L93 Difference]: Finished difference Result 5747 states and 8758 transitions. [2019-10-02 14:57:10,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:57:10,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-10-02 14:57:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:10,122 INFO L225 Difference]: With dead ends: 5747 [2019-10-02 14:57:10,123 INFO L226 Difference]: Without dead ends: 5246 [2019-10-02 14:57:10,125 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:57:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-10-02 14:57:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 1339. [2019-10-02 14:57:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-02 14:57:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2009 transitions. [2019-10-02 14:57:10,276 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2009 transitions. Word has length 57 [2019-10-02 14:57:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:10,276 INFO L475 AbstractCegarLoop]: Abstraction has 1339 states and 2009 transitions. [2019-10-02 14:57:10,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:57:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2009 transitions. [2019-10-02 14:57:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:57:10,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:10,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:10,278 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1896016447, now seen corresponding path program 1 times [2019-10-02 14:57:10,279 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:10,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:10,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:10,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:10,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:10,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:57:10,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:57:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:57:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:10,383 INFO L87 Difference]: Start difference. First operand 1339 states and 2009 transitions. Second operand 9 states. [2019-10-02 14:57:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:12,463 INFO L93 Difference]: Finished difference Result 8481 states and 12775 transitions. [2019-10-02 14:57:12,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:57:12,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-02 14:57:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:12,500 INFO L225 Difference]: With dead ends: 8481 [2019-10-02 14:57:12,501 INFO L226 Difference]: Without dead ends: 7351 [2019-10-02 14:57:12,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:57:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2019-10-02 14:57:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 1378. [2019-10-02 14:57:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-10-02 14:57:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2060 transitions. [2019-10-02 14:57:12,714 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2060 transitions. Word has length 57 [2019-10-02 14:57:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:12,715 INFO L475 AbstractCegarLoop]: Abstraction has 1378 states and 2060 transitions. [2019-10-02 14:57:12,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:57:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2060 transitions. [2019-10-02 14:57:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:57:12,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:12,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:12,717 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1439125625, now seen corresponding path program 1 times [2019-10-02 14:57:12,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:12,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:12,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:12,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:12,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:12,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:57:12,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:57:12,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:57:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:12,867 INFO L87 Difference]: Start difference. First operand 1378 states and 2060 transitions. Second operand 7 states. [2019-10-02 14:57:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:13,814 INFO L93 Difference]: Finished difference Result 5650 states and 8490 transitions. [2019-10-02 14:57:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:57:13,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-02 14:57:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:13,839 INFO L225 Difference]: With dead ends: 5650 [2019-10-02 14:57:13,840 INFO L226 Difference]: Without dead ends: 4520 [2019-10-02 14:57:13,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:57:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-10-02 14:57:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1359. [2019-10-02 14:57:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-10-02 14:57:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2033 transitions. [2019-10-02 14:57:14,086 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2033 transitions. Word has length 58 [2019-10-02 14:57:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:14,087 INFO L475 AbstractCegarLoop]: Abstraction has 1359 states and 2033 transitions. [2019-10-02 14:57:14,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:57:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2033 transitions. [2019-10-02 14:57:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:57:14,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:14,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:14,089 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1839206206, now seen corresponding path program 1 times [2019-10-02 14:57:14,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:14,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:14,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:14,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:57:14,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:57:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:57:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:14,202 INFO L87 Difference]: Start difference. First operand 1359 states and 2033 transitions. Second operand 9 states. [2019-10-02 14:57:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:15,470 INFO L93 Difference]: Finished difference Result 7327 states and 11032 transitions. [2019-10-02 14:57:15,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:57:15,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 14:57:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:15,485 INFO L225 Difference]: With dead ends: 7327 [2019-10-02 14:57:15,486 INFO L226 Difference]: Without dead ends: 6095 [2019-10-02 14:57:15,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:57:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-10-02 14:57:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3782. [2019-10-02 14:57:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states. [2019-10-02 14:57:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5672 transitions. [2019-10-02 14:57:15,995 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5672 transitions. Word has length 58 [2019-10-02 14:57:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:15,996 INFO L475 AbstractCegarLoop]: Abstraction has 3782 states and 5672 transitions. [2019-10-02 14:57:15,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:57:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5672 transitions. [2019-10-02 14:57:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:57:15,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:15,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:15,999 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1369199573, now seen corresponding path program 1 times [2019-10-02 14:57:16,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:16,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:16,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:16,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:16,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:16,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:57:16,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:57:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:57:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:57:16,120 INFO L87 Difference]: Start difference. First operand 3782 states and 5672 transitions. Second operand 9 states. [2019-10-02 14:57:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:18,435 INFO L93 Difference]: Finished difference Result 19307 states and 28995 transitions. [2019-10-02 14:57:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:57:18,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-02 14:57:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:18,474 INFO L225 Difference]: With dead ends: 19307 [2019-10-02 14:57:18,475 INFO L226 Difference]: Without dead ends: 15977 [2019-10-02 14:57:18,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:57:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15977 states. [2019-10-02 14:57:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15977 to 11695. [2019-10-02 14:57:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-10-02 14:57:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 17676 transitions. [2019-10-02 14:57:19,882 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 17676 transitions. Word has length 58 [2019-10-02 14:57:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:19,882 INFO L475 AbstractCegarLoop]: Abstraction has 11695 states and 17676 transitions. [2019-10-02 14:57:19,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:57:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 17676 transitions. [2019-10-02 14:57:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:57:19,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:19,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:19,887 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1177047496, now seen corresponding path program 1 times [2019-10-02 14:57:19,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:19,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:19,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:19,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:19,954 INFO L87 Difference]: Start difference. First operand 11695 states and 17676 transitions. Second operand 6 states. [2019-10-02 14:57:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:21,735 INFO L93 Difference]: Finished difference Result 26750 states and 40687 transitions. [2019-10-02 14:57:21,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:21,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-02 14:57:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:21,773 INFO L225 Difference]: With dead ends: 26750 [2019-10-02 14:57:21,773 INFO L226 Difference]: Without dead ends: 16014 [2019-10-02 14:57:21,794 INFO L640 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-10-02 14:57:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-10-02 14:57:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 9824. [2019-10-02 14:57:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9824 states. [2019-10-02 14:57:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9824 states to 9824 states and 14759 transitions. [2019-10-02 14:57:23,624 INFO L78 Accepts]: Start accepts. Automaton has 9824 states and 14759 transitions. Word has length 59 [2019-10-02 14:57:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:23,624 INFO L475 AbstractCegarLoop]: Abstraction has 9824 states and 14759 transitions. [2019-10-02 14:57:23,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9824 states and 14759 transitions. [2019-10-02 14:57:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:57:23,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:23,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:23,628 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -90485979, now seen corresponding path program 1 times [2019-10-02 14:57:23,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:23,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:23,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:23,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:23,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:23,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:23,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:23,701 INFO L87 Difference]: Start difference. First operand 9824 states and 14759 transitions. Second operand 6 states. [2019-10-02 14:57:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:25,004 INFO L93 Difference]: Finished difference Result 20559 states and 30871 transitions. [2019-10-02 14:57:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:25,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-02 14:57:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:25,028 INFO L225 Difference]: With dead ends: 20559 [2019-10-02 14:57:25,028 INFO L226 Difference]: Without dead ends: 11316 [2019-10-02 14:57:25,045 INFO L640 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-10-02 14:57:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11316 states. [2019-10-02 14:57:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11316 to 7633. [2019-10-02 14:57:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-02 14:57:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11363 transitions. [2019-10-02 14:57:26,153 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11363 transitions. Word has length 59 [2019-10-02 14:57:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:26,154 INFO L475 AbstractCegarLoop]: Abstraction has 7633 states and 11363 transitions. [2019-10-02 14:57:26,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11363 transitions. [2019-10-02 14:57:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:57:26,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:26,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:26,156 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:26,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:26,156 INFO L82 PathProgramCache]: Analyzing trace with hash -226647092, now seen corresponding path program 1 times [2019-10-02 14:57:26,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:26,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:26,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:26,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:26,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:57:26,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:57:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:57:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:26,210 INFO L87 Difference]: Start difference. First operand 7633 states and 11363 transitions. Second operand 5 states. [2019-10-02 14:57:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:27,521 INFO L93 Difference]: Finished difference Result 18447 states and 27375 transitions. [2019-10-02 14:57:27,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:27,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-02 14:57:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:27,538 INFO L225 Difference]: With dead ends: 18447 [2019-10-02 14:57:27,538 INFO L226 Difference]: Without dead ends: 10894 [2019-10-02 14:57:27,550 INFO L640 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-10-02 14:57:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10894 states. [2019-10-02 14:57:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10894 to 7633. [2019-10-02 14:57:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7633 states. [2019-10-02 14:57:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 11259 transitions. [2019-10-02 14:57:28,787 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 11259 transitions. Word has length 59 [2019-10-02 14:57:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:28,787 INFO L475 AbstractCegarLoop]: Abstraction has 7633 states and 11259 transitions. [2019-10-02 14:57:28,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:57:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 11259 transitions. [2019-10-02 14:57:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:57:28,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:28,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:28,789 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash 758768658, now seen corresponding path program 1 times [2019-10-02 14:57:28,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:28,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:28,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:28,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:28,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:28,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:28,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:57:28,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:57:28,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:57:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:28,857 INFO L87 Difference]: Start difference. First operand 7633 states and 11259 transitions. Second operand 5 states. [2019-10-02 14:57:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:30,779 INFO L93 Difference]: Finished difference Result 20122 states and 29836 transitions. [2019-10-02 14:57:30,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:30,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-02 14:57:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:30,801 INFO L225 Difference]: With dead ends: 20122 [2019-10-02 14:57:30,801 INFO L226 Difference]: Without dead ends: 16178 [2019-10-02 14:57:30,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16178 states. [2019-10-02 14:57:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16178 to 9877. [2019-10-02 14:57:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-10-02 14:57:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 14629 transitions. [2019-10-02 14:57:32,063 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 14629 transitions. Word has length 60 [2019-10-02 14:57:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:32,063 INFO L475 AbstractCegarLoop]: Abstraction has 9877 states and 14629 transitions. [2019-10-02 14:57:32,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:57:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 14629 transitions. [2019-10-02 14:57:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:57:32,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:32,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:32,066 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2035448048, now seen corresponding path program 1 times [2019-10-02 14:57:32,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:32,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:32,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:32,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:32,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:32,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:32,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:57:32,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:57:32,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:57:32,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:32,134 INFO L87 Difference]: Start difference. First operand 9877 states and 14629 transitions. Second operand 5 states. [2019-10-02 14:57:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:34,210 INFO L93 Difference]: Finished difference Result 21379 states and 31737 transitions. [2019-10-02 14:57:34,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:34,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-02 14:57:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:34,229 INFO L225 Difference]: With dead ends: 21379 [2019-10-02 14:57:34,229 INFO L226 Difference]: Without dead ends: 17435 [2019-10-02 14:57:34,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17435 states. [2019-10-02 14:57:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17435 to 11320. [2019-10-02 14:57:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11320 states. [2019-10-02 14:57:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 16793 transitions. [2019-10-02 14:57:35,951 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 16793 transitions. Word has length 60 [2019-10-02 14:57:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:35,951 INFO L475 AbstractCegarLoop]: Abstraction has 11320 states and 16793 transitions. [2019-10-02 14:57:35,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:57:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 16793 transitions. [2019-10-02 14:57:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:57:35,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:35,954 INFO L411 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] [2019-10-02 14:57:35,954 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2033763663, now seen corresponding path program 1 times [2019-10-02 14:57:35,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:35,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:35,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:35,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:35,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:57:36,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:57:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:57:36,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:57:36,023 INFO L87 Difference]: Start difference. First operand 11320 states and 16793 transitions. Second operand 7 states. [2019-10-02 14:57:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:42,869 INFO L93 Difference]: Finished difference Result 54051 states and 79490 transitions. [2019-10-02 14:57:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:57:42,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-10-02 14:57:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:42,923 INFO L225 Difference]: With dead ends: 54051 [2019-10-02 14:57:42,923 INFO L226 Difference]: Without dead ends: 48732 [2019-10-02 14:57:42,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:57:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48732 states. [2019-10-02 14:57:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48732 to 11416. [2019-10-02 14:57:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11416 states. [2019-10-02 14:57:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 16915 transitions. [2019-10-02 14:57:44,611 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 16915 transitions. Word has length 63 [2019-10-02 14:57:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:44,612 INFO L475 AbstractCegarLoop]: Abstraction has 11416 states and 16915 transitions. [2019-10-02 14:57:44,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:57:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 16915 transitions. [2019-10-02 14:57:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 14:57:44,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:44,615 INFO L411 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] [2019-10-02 14:57:44,615 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash -640902223, now seen corresponding path program 1 times [2019-10-02 14:57:44,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:44,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:44,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:44,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:44,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:44,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:44,657 INFO L87 Difference]: Start difference. First operand 11416 states and 16915 transitions. Second operand 3 states. [2019-10-02 14:57:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:46,843 INFO L93 Difference]: Finished difference Result 27762 states and 41149 transitions. [2019-10-02 14:57:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:46,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-02 14:57:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:46,865 INFO L225 Difference]: With dead ends: 27762 [2019-10-02 14:57:46,865 INFO L226 Difference]: Without dead ends: 16920 [2019-10-02 14:57:46,882 INFO L640 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-10-02 14:57:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16920 states. [2019-10-02 14:57:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16920 to 13802. [2019-10-02 14:57:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-10-02 14:57:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20148 transitions. [2019-10-02 14:57:49,397 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20148 transitions. Word has length 63 [2019-10-02 14:57:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:49,398 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20148 transitions. [2019-10-02 14:57:49,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:57:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20148 transitions. [2019-10-02 14:57:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 14:57:49,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:49,402 INFO L411 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-10-02 14:57:49,403 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:49,403 INFO L82 PathProgramCache]: Analyzing trace with hash 3874310, now seen corresponding path program 1 times [2019-10-02 14:57:49,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:49,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:49,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:49,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:49,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:49,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:57:49,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:57:49,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:57:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:57:49,637 INFO L87 Difference]: Start difference. First operand 13802 states and 20148 transitions. Second operand 10 states. [2019-10-02 14:57:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:57,081 INFO L93 Difference]: Finished difference Result 48893 states and 70897 transitions. [2019-10-02 14:57:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:57:57,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-10-02 14:57:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:57,119 INFO L225 Difference]: With dead ends: 48893 [2019-10-02 14:57:57,120 INFO L226 Difference]: Without dead ends: 36117 [2019-10-02 14:57:57,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:57:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36117 states. [2019-10-02 14:57:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36117 to 13802. [2019-10-02 14:57:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2019-10-02 14:57:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 20142 transitions. [2019-10-02 14:57:59,486 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 20142 transitions. Word has length 65 [2019-10-02 14:57:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:59,486 INFO L475 AbstractCegarLoop]: Abstraction has 13802 states and 20142 transitions. [2019-10-02 14:57:59,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:57:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 20142 transitions. [2019-10-02 14:57:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 14:57:59,489 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:59,489 INFO L411 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-10-02 14:57:59,489 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1838871740, now seen corresponding path program 1 times [2019-10-02 14:57:59,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:59,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:59,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:59,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:59,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:57:59,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:57:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:57:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:57:59,691 INFO L87 Difference]: Start difference. First operand 13802 states and 20142 transitions. Second operand 10 states. [2019-10-02 14:58:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:07,881 INFO L93 Difference]: Finished difference Result 50585 states and 73484 transitions. [2019-10-02 14:58:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:58:07,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-10-02 14:58:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:07,936 INFO L225 Difference]: With dead ends: 50585 [2019-10-02 14:58:07,937 INFO L226 Difference]: Without dead ends: 37871 [2019-10-02 14:58:07,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:58:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37871 states. [2019-10-02 14:58:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37871 to 13590. [2019-10-02 14:58:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13590 states. [2019-10-02 14:58:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13590 states to 13590 states and 19823 transitions. [2019-10-02 14:58:10,673 INFO L78 Accepts]: Start accepts. Automaton has 13590 states and 19823 transitions. Word has length 65 [2019-10-02 14:58:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:10,673 INFO L475 AbstractCegarLoop]: Abstraction has 13590 states and 19823 transitions. [2019-10-02 14:58:10,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:58:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 13590 states and 19823 transitions. [2019-10-02 14:58:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 14:58:10,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:10,676 INFO L411 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-10-02 14:58:10,676 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash 434457602, now seen corresponding path program 1 times [2019-10-02 14:58:10,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:10,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:10,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:10,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:10,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:58:10,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:58:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:58:10,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:58:10,880 INFO L87 Difference]: Start difference. First operand 13590 states and 19823 transitions. Second operand 10 states. [2019-10-02 14:58:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:19,229 INFO L93 Difference]: Finished difference Result 48012 states and 69656 transitions. [2019-10-02 14:58:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:58:19,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-10-02 14:58:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:19,266 INFO L225 Difference]: With dead ends: 48012 [2019-10-02 14:58:19,266 INFO L226 Difference]: Without dead ends: 35476 [2019-10-02 14:58:19,280 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:58:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35476 states. [2019-10-02 14:58:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35476 to 13459. [2019-10-02 14:58:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13459 states. [2019-10-02 14:58:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13459 states to 13459 states and 19616 transitions. [2019-10-02 14:58:21,933 INFO L78 Accepts]: Start accepts. Automaton has 13459 states and 19616 transitions. Word has length 65 [2019-10-02 14:58:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:21,933 INFO L475 AbstractCegarLoop]: Abstraction has 13459 states and 19616 transitions. [2019-10-02 14:58:21,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:58:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13459 states and 19616 transitions. [2019-10-02 14:58:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:58:21,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:21,936 INFO L411 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] [2019-10-02 14:58:21,936 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash 451101849, now seen corresponding path program 1 times [2019-10-02 14:58:21,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:21,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:21,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:21,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:21,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:21,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:21,983 INFO L87 Difference]: Start difference. First operand 13459 states and 19616 transitions. Second operand 3 states. [2019-10-02 14:58:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:24,678 INFO L93 Difference]: Finished difference Result 19543 states and 28416 transitions. [2019-10-02 14:58:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:24,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-02 14:58:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:24,691 INFO L225 Difference]: With dead ends: 19543 [2019-10-02 14:58:24,691 INFO L226 Difference]: Without dead ends: 13443 [2019-10-02 14:58:24,697 INFO L640 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-10-02 14:58:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13443 states. [2019-10-02 14:58:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13443 to 13441. [2019-10-02 14:58:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13441 states. [2019-10-02 14:58:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13441 states to 13441 states and 19290 transitions. [2019-10-02 14:58:27,128 INFO L78 Accepts]: Start accepts. Automaton has 13441 states and 19290 transitions. Word has length 66 [2019-10-02 14:58:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:27,128 INFO L475 AbstractCegarLoop]: Abstraction has 13441 states and 19290 transitions. [2019-10-02 14:58:27,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 13441 states and 19290 transitions. [2019-10-02 14:58:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:58:27,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:27,130 INFO L411 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] [2019-10-02 14:58:27,131 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1791143987, now seen corresponding path program 1 times [2019-10-02 14:58:27,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:27,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:27,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:27,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:27,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:27,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:27,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:27,191 INFO L87 Difference]: Start difference. First operand 13441 states and 19290 transitions. Second operand 3 states. [2019-10-02 14:58:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:29,523 INFO L93 Difference]: Finished difference Result 18163 states and 25978 transitions. [2019-10-02 14:58:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:29,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-02 14:58:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:29,536 INFO L225 Difference]: With dead ends: 18163 [2019-10-02 14:58:29,536 INFO L226 Difference]: Without dead ends: 12081 [2019-10-02 14:58:29,546 INFO L640 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-10-02 14:58:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12081 states. [2019-10-02 14:58:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12081 to 12079. [2019-10-02 14:58:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12079 states. [2019-10-02 14:58:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12079 states to 12079 states and 17023 transitions. [2019-10-02 14:58:31,769 INFO L78 Accepts]: Start accepts. Automaton has 12079 states and 17023 transitions. Word has length 66 [2019-10-02 14:58:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:31,769 INFO L475 AbstractCegarLoop]: Abstraction has 12079 states and 17023 transitions. [2019-10-02 14:58:31,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 12079 states and 17023 transitions. [2019-10-02 14:58:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:58:31,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:31,771 INFO L411 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] [2019-10-02 14:58:31,771 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1997471743, now seen corresponding path program 1 times [2019-10-02 14:58:31,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:31,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:31,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:31,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:31,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:31,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:31,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:31,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:31,818 INFO L87 Difference]: Start difference. First operand 12079 states and 17023 transitions. Second operand 3 states. [2019-10-02 14:58:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:34,043 INFO L93 Difference]: Finished difference Result 14693 states and 20612 transitions. [2019-10-02 14:58:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:34,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-02 14:58:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:34,055 INFO L225 Difference]: With dead ends: 14693 [2019-10-02 14:58:34,055 INFO L226 Difference]: Without dead ends: 10303 [2019-10-02 14:58:34,061 INFO L640 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-10-02 14:58:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2019-10-02 14:58:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 10301. [2019-10-02 14:58:35,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-10-02 14:58:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 14211 transitions. [2019-10-02 14:58:35,910 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 14211 transitions. Word has length 66 [2019-10-02 14:58:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:35,910 INFO L475 AbstractCegarLoop]: Abstraction has 10301 states and 14211 transitions. [2019-10-02 14:58:35,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 14211 transitions. [2019-10-02 14:58:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:58:35,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:35,913 INFO L411 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-10-02 14:58:35,913 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1675019531, now seen corresponding path program 1 times [2019-10-02 14:58:35,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:35,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:35,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:35,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:35,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:35,947 INFO L87 Difference]: Start difference. First operand 10301 states and 14211 transitions. Second operand 3 states. [2019-10-02 14:58:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:38,998 INFO L93 Difference]: Finished difference Result 19134 states and 26484 transitions. [2019-10-02 14:58:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:38,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-02 14:58:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:39,011 INFO L225 Difference]: With dead ends: 19134 [2019-10-02 14:58:39,012 INFO L226 Difference]: Without dead ends: 15154 [2019-10-02 14:58:39,016 INFO L640 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-10-02 14:58:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15154 states. [2019-10-02 14:58:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15154 to 10108. [2019-10-02 14:58:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2019-10-02 14:58:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 13933 transitions. [2019-10-02 14:58:40,882 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 13933 transitions. Word has length 67 [2019-10-02 14:58:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:40,882 INFO L475 AbstractCegarLoop]: Abstraction has 10108 states and 13933 transitions. [2019-10-02 14:58:40,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 13933 transitions. [2019-10-02 14:58:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:58:40,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:40,885 INFO L411 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-10-02 14:58:40,885 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:40,886 INFO L82 PathProgramCache]: Analyzing trace with hash 641499340, now seen corresponding path program 1 times [2019-10-02 14:58:40,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:40,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:40,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:40,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:40,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:40,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:40,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:40,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:40,921 INFO L87 Difference]: Start difference. First operand 10108 states and 13933 transitions. Second operand 3 states. [2019-10-02 14:58:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:44,065 INFO L93 Difference]: Finished difference Result 18916 states and 26144 transitions. [2019-10-02 14:58:44,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:44,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-02 14:58:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:44,081 INFO L225 Difference]: With dead ends: 18916 [2019-10-02 14:58:44,081 INFO L226 Difference]: Without dead ends: 15010 [2019-10-02 14:58:44,088 INFO L640 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-10-02 14:58:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15010 states. [2019-10-02 14:58:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15010 to 9964. [2019-10-02 14:58:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9964 states. [2019-10-02 14:58:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9964 states to 9964 states and 13716 transitions. [2019-10-02 14:58:46,172 INFO L78 Accepts]: Start accepts. Automaton has 9964 states and 13716 transitions. Word has length 67 [2019-10-02 14:58:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:46,172 INFO L475 AbstractCegarLoop]: Abstraction has 9964 states and 13716 transitions. [2019-10-02 14:58:46,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 9964 states and 13716 transitions. [2019-10-02 14:58:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:58:46,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:46,174 INFO L411 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-10-02 14:58:46,174 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1770759349, now seen corresponding path program 1 times [2019-10-02 14:58:46,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:46,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:46,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:46,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:46,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 14:58:46,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:58:46,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:58:46,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:58:46,844 INFO L87 Difference]: Start difference. First operand 9964 states and 13716 transitions. Second operand 23 states. [2019-10-02 14:58:47,016 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-10-02 14:58:47,991 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-02 14:58:48,335 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2019-10-02 14:58:48,586 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-10-02 14:59:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:01,439 INFO L93 Difference]: Finished difference Result 40997 states and 56941 transitions. [2019-10-02 14:59:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 14:59:01,440 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-10-02 14:59:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:01,478 INFO L225 Difference]: With dead ends: 40997 [2019-10-02 14:59:01,478 INFO L226 Difference]: Without dead ends: 40432 [2019-10-02 14:59:01,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=467, Invalid=2185, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:59:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40432 states. [2019-10-02 14:59:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40432 to 9976. [2019-10-02 14:59:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9976 states. [2019-10-02 14:59:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 13731 transitions. [2019-10-02 14:59:03,945 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 13731 transitions. Word has length 67 [2019-10-02 14:59:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:03,945 INFO L475 AbstractCegarLoop]: Abstraction has 9976 states and 13731 transitions. [2019-10-02 14:59:03,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:59:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 13731 transitions. [2019-10-02 14:59:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:59:03,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:03,947 INFO L411 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-10-02 14:59:03,947 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:03,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1042489363, now seen corresponding path program 1 times [2019-10-02 14:59:03,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:03,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:03,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:03,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:03,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:04,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:04,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 14:59:04,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:59:04,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:59:04,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:59:04,645 INFO L87 Difference]: Start difference. First operand 9976 states and 13731 transitions. Second operand 23 states. [2019-10-02 14:59:04,909 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-10-02 14:59:05,811 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-02 14:59:06,131 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-02 14:59:06,421 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-02 14:59:06,854 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-10-02 14:59:07,218 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-10-02 14:59:07,383 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-02 14:59:07,619 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-02 14:59:07,950 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 14:59:08,170 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 14:59:08,689 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 14:59:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:23,079 INFO L93 Difference]: Finished difference Result 45893 states and 63727 transitions. [2019-10-02 14:59:23,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:59:23,079 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-10-02 14:59:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:23,285 INFO L225 Difference]: With dead ends: 45893 [2019-10-02 14:59:23,285 INFO L226 Difference]: Without dead ends: 45328 [2019-10-02 14:59:23,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:59:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45328 states. [2019-10-02 14:59:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45328 to 9958. [2019-10-02 14:59:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9958 states. [2019-10-02 14:59:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 13705 transitions. [2019-10-02 14:59:25,837 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 13705 transitions. Word has length 67 [2019-10-02 14:59:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:25,837 INFO L475 AbstractCegarLoop]: Abstraction has 9958 states and 13705 transitions. [2019-10-02 14:59:25,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:59:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 13705 transitions. [2019-10-02 14:59:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:59:25,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:25,839 INFO L411 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-10-02 14:59:25,839 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2122497903, now seen corresponding path program 1 times [2019-10-02 14:59:25,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:25,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:25,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:26,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:26,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 14:59:26,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:59:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:59:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:59:26,500 INFO L87 Difference]: Start difference. First operand 9958 states and 13705 transitions. Second operand 23 states. [2019-10-02 14:59:26,693 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-10-02 14:59:27,687 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-02 14:59:28,014 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-02 14:59:28,812 WARN L191 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-10-02 14:59:29,534 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 14:59:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:41,345 INFO L93 Difference]: Finished difference Result 34622 states and 48088 transitions. [2019-10-02 14:59:41,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:59:41,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-10-02 14:59:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:41,380 INFO L225 Difference]: With dead ends: 34622 [2019-10-02 14:59:41,380 INFO L226 Difference]: Without dead ends: 34057 [2019-10-02 14:59:41,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=380, Invalid=1600, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:59:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34057 states. [2019-10-02 14:59:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34057 to 9940. [2019-10-02 14:59:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9940 states. [2019-10-02 14:59:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9940 states to 9940 states and 13679 transitions. [2019-10-02 14:59:44,102 INFO L78 Accepts]: Start accepts. Automaton has 9940 states and 13679 transitions. Word has length 67 [2019-10-02 14:59:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:44,102 INFO L475 AbstractCegarLoop]: Abstraction has 9940 states and 13679 transitions. [2019-10-02 14:59:44,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:59:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 9940 states and 13679 transitions. [2019-10-02 14:59:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:59:44,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:44,104 INFO L411 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-10-02 14:59:44,104 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:44,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:44,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2129601635, now seen corresponding path program 1 times [2019-10-02 14:59:44,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:44,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:44,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:44,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:44,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:44,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:44,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:59:44,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:59:44,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:59:44,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:59:44,556 INFO L87 Difference]: Start difference. First operand 9940 states and 13679 transitions. Second operand 13 states. [2019-10-02 14:59:44,954 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-10-02 14:59:45,102 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-02 14:59:45,259 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-02 14:59:45,422 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 14:59:45,796 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-02 14:59:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:54,188 INFO L93 Difference]: Finished difference Result 29867 states and 41342 transitions. [2019-10-02 14:59:54,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:59:54,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-10-02 14:59:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:54,215 INFO L225 Difference]: With dead ends: 29867 [2019-10-02 14:59:54,215 INFO L226 Difference]: Without dead ends: 27573 [2019-10-02 14:59:54,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:59:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27573 states. [2019-10-02 14:59:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27573 to 9856. [2019-10-02 14:59:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9856 states. [2019-10-02 14:59:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9856 states to 9856 states and 13568 transitions. [2019-10-02 14:59:57,252 INFO L78 Accepts]: Start accepts. Automaton has 9856 states and 13568 transitions. Word has length 68 [2019-10-02 14:59:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:57,253 INFO L475 AbstractCegarLoop]: Abstraction has 9856 states and 13568 transitions. [2019-10-02 14:59:57,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:59:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9856 states and 13568 transitions. [2019-10-02 14:59:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:59:57,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:57,254 INFO L411 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-10-02 14:59:57,255 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:57,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 122708509, now seen corresponding path program 1 times [2019-10-02 14:59:57,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:58,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 14:59:58,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 14:59:58,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 14:59:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:59:58,014 INFO L87 Difference]: Start difference. First operand 9856 states and 13568 transitions. Second operand 18 states. [2019-10-02 14:59:58,713 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-10-02 14:59:59,058 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-02 14:59:59,406 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-02 14:59:59,636 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-02 14:59:59,949 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-02 15:00:00,141 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-02 15:00:00,388 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-02 15:00:00,670 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-02 15:00:00,855 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-10-02 15:00:01,049 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-02 15:00:01,831 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-10-02 15:00:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:17,194 INFO L93 Difference]: Finished difference Result 45385 states and 62962 transitions. [2019-10-02 15:00:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 15:00:17,194 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-10-02 15:00:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:17,233 INFO L225 Difference]: With dead ends: 45385 [2019-10-02 15:00:17,233 INFO L226 Difference]: Without dead ends: 44434 [2019-10-02 15:00:17,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 15:00:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44434 states. [2019-10-02 15:00:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44434 to 9819. [2019-10-02 15:00:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-10-02 15:00:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 13516 transitions. [2019-10-02 15:00:20,498 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 13516 transitions. Word has length 68 [2019-10-02 15:00:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:20,498 INFO L475 AbstractCegarLoop]: Abstraction has 9819 states and 13516 transitions. [2019-10-02 15:00:20,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 15:00:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 13516 transitions. [2019-10-02 15:00:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 15:00:20,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:20,500 INFO L411 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-10-02 15:00:20,500 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:20,501 INFO L82 PathProgramCache]: Analyzing trace with hash 780074214, now seen corresponding path program 1 times [2019-10-02 15:00:20,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:20,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:20,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:20,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:20,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:20,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:00:20,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:00:20,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:00:20,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:20,575 INFO L87 Difference]: Start difference. First operand 9819 states and 13516 transitions. Second operand 5 states. [2019-10-02 15:00:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:23,629 INFO L93 Difference]: Finished difference Result 9825 states and 13519 transitions. [2019-10-02 15:00:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:23,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-10-02 15:00:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:23,636 INFO L225 Difference]: With dead ends: 9825 [2019-10-02 15:00:23,636 INFO L226 Difference]: Without dead ends: 9445 [2019-10-02 15:00:23,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9445 states. [2019-10-02 15:00:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9445 to 9441. [2019-10-02 15:00:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-10-02 15:00:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 13016 transitions. [2019-10-02 15:00:26,605 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 13016 transitions. Word has length 69 [2019-10-02 15:00:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:26,605 INFO L475 AbstractCegarLoop]: Abstraction has 9441 states and 13016 transitions. [2019-10-02 15:00:26,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:00:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 13016 transitions. [2019-10-02 15:00:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 15:00:26,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:26,607 INFO L411 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-10-02 15:00:26,607 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:26,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash 210202670, now seen corresponding path program 1 times [2019-10-02 15:00:26,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:26,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:26,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:26,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:26,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:00:26,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:00:26,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:00:26,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:00:26,685 INFO L87 Difference]: Start difference. First operand 9441 states and 13016 transitions. Second operand 6 states. [2019-10-02 15:00:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:32,927 INFO L93 Difference]: Finished difference Result 17930 states and 24410 transitions. [2019-10-02 15:00:32,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:00:32,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-02 15:00:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:32,944 INFO L225 Difference]: With dead ends: 17930 [2019-10-02 15:00:32,944 INFO L226 Difference]: Without dead ends: 17928 [2019-10-02 15:00:32,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17928 states. [2019-10-02 15:00:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17928 to 9756. [2019-10-02 15:00:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9756 states. [2019-10-02 15:00:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9756 states to 9756 states and 13246 transitions. [2019-10-02 15:00:36,740 INFO L78 Accepts]: Start accepts. Automaton has 9756 states and 13246 transitions. Word has length 72 [2019-10-02 15:00:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:36,740 INFO L475 AbstractCegarLoop]: Abstraction has 9756 states and 13246 transitions. [2019-10-02 15:00:36,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:00:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 9756 states and 13246 transitions. [2019-10-02 15:00:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 15:00:36,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:36,742 INFO L411 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-10-02 15:00:36,743 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:36,743 INFO L82 PathProgramCache]: Analyzing trace with hash -61361821, now seen corresponding path program 1 times [2019-10-02 15:00:36,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:36,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:36,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:36,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:36,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:36,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:36,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:36,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:36,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:36,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:36,788 INFO L87 Difference]: Start difference. First operand 9756 states and 13246 transitions. Second operand 3 states. [2019-10-02 15:00:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:42,546 INFO L93 Difference]: Finished difference Result 26435 states and 35970 transitions. [2019-10-02 15:00:42,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:42,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 15:00:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:42,564 INFO L225 Difference]: With dead ends: 26435 [2019-10-02 15:00:42,564 INFO L226 Difference]: Without dead ends: 17157 [2019-10-02 15:00:42,573 INFO L640 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-10-02 15:00:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17157 states. [2019-10-02 15:00:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17157 to 16945. [2019-10-02 15:00:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16945 states. [2019-10-02 15:00:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16945 states to 16945 states and 22658 transitions. [2019-10-02 15:00:48,240 INFO L78 Accepts]: Start accepts. Automaton has 16945 states and 22658 transitions. Word has length 73 [2019-10-02 15:00:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:48,241 INFO L475 AbstractCegarLoop]: Abstraction has 16945 states and 22658 transitions. [2019-10-02 15:00:48,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 16945 states and 22658 transitions. [2019-10-02 15:00:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 15:00:48,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:48,244 INFO L411 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-10-02 15:00:48,245 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1062164750, now seen corresponding path program 1 times [2019-10-02 15:00:48,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:48,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:48,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:48,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:48,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:48,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:48,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:48,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:48,283 INFO L87 Difference]: Start difference. First operand 16945 states and 22658 transitions. Second operand 3 states. [2019-10-02 15:00:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:59,377 INFO L93 Difference]: Finished difference Result 47957 states and 63912 transitions. [2019-10-02 15:00:59,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:59,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-02 15:00:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:59,407 INFO L225 Difference]: With dead ends: 47957 [2019-10-02 15:00:59,407 INFO L226 Difference]: Without dead ends: 31609 [2019-10-02 15:00:59,421 INFO L640 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-10-02 15:00:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31609 states. [2019-10-02 15:01:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31609 to 29323. [2019-10-02 15:01:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29323 states. [2019-10-02 15:01:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29323 states to 29323 states and 38792 transitions. [2019-10-02 15:01:09,299 INFO L78 Accepts]: Start accepts. Automaton has 29323 states and 38792 transitions. Word has length 75 [2019-10-02 15:01:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:09,299 INFO L475 AbstractCegarLoop]: Abstraction has 29323 states and 38792 transitions. [2019-10-02 15:01:09,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 29323 states and 38792 transitions. [2019-10-02 15:01:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 15:01:09,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:09,303 INFO L411 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-10-02 15:01:09,303 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1917451455, now seen corresponding path program 1 times [2019-10-02 15:01:09,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:09,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:09,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:09,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:09,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:09,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:09,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:09,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:09,338 INFO L87 Difference]: Start difference. First operand 29323 states and 38792 transitions. Second operand 3 states. [2019-10-02 15:01:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:26,096 INFO L93 Difference]: Finished difference Result 74419 states and 98222 transitions. [2019-10-02 15:01:26,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:26,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-02 15:01:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:26,141 INFO L225 Difference]: With dead ends: 74419 [2019-10-02 15:01:26,141 INFO L226 Difference]: Without dead ends: 45553 [2019-10-02 15:01:26,161 INFO L640 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-10-02 15:01:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45553 states. [2019-10-02 15:01:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45553 to 41615. [2019-10-02 15:01:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41615 states. [2019-10-02 15:01:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41615 states to 41615 states and 54612 transitions. [2019-10-02 15:01:40,465 INFO L78 Accepts]: Start accepts. Automaton has 41615 states and 54612 transitions. Word has length 76 [2019-10-02 15:01:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:40,465 INFO L475 AbstractCegarLoop]: Abstraction has 41615 states and 54612 transitions. [2019-10-02 15:01:40,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 41615 states and 54612 transitions. [2019-10-02 15:01:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 15:01:40,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:40,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:40,468 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:40,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:40,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2051052788, now seen corresponding path program 1 times [2019-10-02 15:01:40,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:40,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:40,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:40,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:40,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:40,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:40,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:40,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:40,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:40,525 INFO L87 Difference]: Start difference. First operand 41615 states and 54612 transitions. Second operand 5 states. [2019-10-02 15:02:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:06,703 INFO L93 Difference]: Finished difference Result 108181 states and 140796 transitions. [2019-10-02 15:02:06,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:02:06,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-02 15:02:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:06,773 INFO L225 Difference]: With dead ends: 108181 [2019-10-02 15:02:06,773 INFO L226 Difference]: Without dead ends: 66978 [2019-10-02 15:02:06,801 INFO L640 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-10-02 15:02:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66978 states. [2019-10-02 15:02:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66978 to 38553. [2019-10-02 15:02:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38553 states. [2019-10-02 15:02:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38553 states to 38553 states and 49077 transitions. [2019-10-02 15:02:20,283 INFO L78 Accepts]: Start accepts. Automaton has 38553 states and 49077 transitions. Word has length 82 [2019-10-02 15:02:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:20,283 INFO L475 AbstractCegarLoop]: Abstraction has 38553 states and 49077 transitions. [2019-10-02 15:02:20,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:02:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38553 states and 49077 transitions. [2019-10-02 15:02:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 15:02:20,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:20,287 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:20,287 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1781698448, now seen corresponding path program 1 times [2019-10-02 15:02:20,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:20,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 15:02:20,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:20,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:20,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:20,330 INFO L87 Difference]: Start difference. First operand 38553 states and 49077 transitions. Second operand 3 states. [2019-10-02 15:02:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:46,646 INFO L93 Difference]: Finished difference Result 110399 states and 139929 transitions. [2019-10-02 15:02:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:46,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-02 15:02:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:46,716 INFO L225 Difference]: With dead ends: 110399 [2019-10-02 15:02:46,717 INFO L226 Difference]: Without dead ends: 72288 [2019-10-02 15:02:46,747 INFO L640 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-10-02 15:02:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72288 states. [2019-10-02 15:03:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72288 to 62546. [2019-10-02 15:03:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62546 states. [2019-10-02 15:03:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62546 states to 62546 states and 78768 transitions. [2019-10-02 15:03:08,532 INFO L78 Accepts]: Start accepts. Automaton has 62546 states and 78768 transitions. Word has length 93 [2019-10-02 15:03:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:08,532 INFO L475 AbstractCegarLoop]: Abstraction has 62546 states and 78768 transitions. [2019-10-02 15:03:08,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 62546 states and 78768 transitions. [2019-10-02 15:03:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 15:03:08,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:08,538 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:03:08,538 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1356554498, now seen corresponding path program 1 times [2019-10-02 15:03:08,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:08,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:08,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:08,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:08,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:03:08,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:08,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 15:03:08,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:03:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:03:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:03:08,742 INFO L87 Difference]: Start difference. First operand 62546 states and 78768 transitions. Second operand 10 states. [2019-10-02 15:04:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:30,697 INFO L93 Difference]: Finished difference Result 254630 states and 318818 transitions. [2019-10-02 15:04:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 15:04:30,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-10-02 15:04:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:30,956 INFO L225 Difference]: With dead ends: 254630 [2019-10-02 15:04:30,956 INFO L226 Difference]: Without dead ends: 217132 [2019-10-02 15:04:31,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 15:04:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217132 states. [2019-10-02 15:05:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217132 to 83812. [2019-10-02 15:05:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83812 states. [2019-10-02 15:05:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83812 states to 83812 states and 105544 transitions. [2019-10-02 15:05:05,593 INFO L78 Accepts]: Start accepts. Automaton has 83812 states and 105544 transitions. Word has length 96 [2019-10-02 15:05:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:05,593 INFO L475 AbstractCegarLoop]: Abstraction has 83812 states and 105544 transitions. [2019-10-02 15:05:05,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 15:05:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 83812 states and 105544 transitions. [2019-10-02 15:05:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 15:05:05,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:05,599 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:05,599 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1244823914, now seen corresponding path program 1 times [2019-10-02 15:05:05,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:05,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:05,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:05,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:05:05,789 INFO L224 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-10-02 15:05:05,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:05,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 15:05:05,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:05:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:05:06,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:05:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:06,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:05:06,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2019-10-02 15:05:06,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 15:05:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 15:05:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:05:06,796 INFO L87 Difference]: Start difference. First operand 83812 states and 105544 transitions. Second operand 19 states. [2019-10-02 15:05:07,063 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-02 15:05:07,217 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-02 15:05:09,034 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-10-02 15:05:09,674 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-10-02 15:05:11,497 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 15:05:12,303 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 15:05:13,441 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-02 15:05:13,861 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-10-02 15:05:14,760 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-10-02 15:05:18,801 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-10-02 15:05:19,192 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-02 15:05:20,787 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 15:05:22,013 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-02 15:05:23,149 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-02 15:05:36,196 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-02 15:05:37,392 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-02 15:06:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:45,589 INFO L93 Difference]: Finished difference Result 260979 states and 325650 transitions. [2019-10-02 15:06:45,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 15:06:45,589 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-10-02 15:06:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:46,235 INFO L225 Difference]: With dead ends: 260979 [2019-10-02 15:06:46,236 INFO L226 Difference]: Without dead ends: 216951 [2019-10-02 15:06:46,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=952, Invalid=3208, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 15:06:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216951 states. [2019-10-02 15:07:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216951 to 115694. [2019-10-02 15:07:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115694 states. [2019-10-02 15:07:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115694 states to 115694 states and 145728 transitions. [2019-10-02 15:07:32,180 INFO L78 Accepts]: Start accepts. Automaton has 115694 states and 145728 transitions. Word has length 96 [2019-10-02 15:07:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:32,181 INFO L475 AbstractCegarLoop]: Abstraction has 115694 states and 145728 transitions. [2019-10-02 15:07:32,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 15:07:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 115694 states and 145728 transitions. [2019-10-02 15:07:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 15:07:32,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:32,199 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:32,199 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 942692355, now seen corresponding path program 1 times [2019-10-02 15:07:32,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:32,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:32,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:32,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:07:32,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:07:32,339 INFO L224 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-10-02 15:07:32,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:32,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 15:07:32,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:07:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:07:32,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:07:32,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 11 [2019-10-02 15:07:32,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 15:07:32,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 15:07:32,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:07:32,930 INFO L87 Difference]: Start difference. First operand 115694 states and 145728 transitions. Second operand 11 states. [2019-10-02 15:08:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:40,502 INFO L93 Difference]: Finished difference Result 280413 states and 352929 transitions. [2019-10-02 15:08:40,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 15:08:40,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-10-02 15:08:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:40,727 INFO L225 Difference]: With dead ends: 280413 [2019-10-02 15:08:40,727 INFO L226 Difference]: Without dead ends: 165161 [2019-10-02 15:08:40,833 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:08:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165161 states. [2019-10-02 15:09:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165161 to 152334. [2019-10-02 15:09:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152334 states. [2019-10-02 15:09:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152334 states to 152334 states and 191676 transitions. [2019-10-02 15:09:44,593 INFO L78 Accepts]: Start accepts. Automaton has 152334 states and 191676 transitions. Word has length 97 [2019-10-02 15:09:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:44,593 INFO L475 AbstractCegarLoop]: Abstraction has 152334 states and 191676 transitions. [2019-10-02 15:09:44,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 15:09:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 152334 states and 191676 transitions. [2019-10-02 15:09:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 15:09:44,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:44,612 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:09:44,612 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1161715826, now seen corresponding path program 1 times [2019-10-02 15:09:44,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:44,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:44,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:09:44,672 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:09:44,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:44,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 15:09:44,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:09:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:44,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:09:44,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-10-02 15:09:44,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:09:44,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:09:44,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:09:44,983 INFO L87 Difference]: Start difference. First operand 152334 states and 191676 transitions. Second operand 10 states.