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/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:09:58,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:09:58,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:09:58,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:09:58,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:09:58,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:09:58,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:09:58,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:09:58,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:09:58,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:09:58,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:09:59,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:09:59,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:09:59,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:09:59,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:09:59,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:09:59,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:09:59,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:09:59,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:09:59,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:09:59,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:09:59,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:09:59,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:09:59,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:09:59,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:09:59,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:09:59,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:09:59,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:09:59,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:09:59,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:09:59,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:09:59,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:09:59,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:09:59,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:09:59,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:09:59,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:09:59,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:09:59,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:09:59,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:09:59,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:09:59,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:09:59,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 08:09:59,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:09:59,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:09:59,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:09:59,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:09:59,059 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:09:59,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:09:59,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:09:59,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:09:59,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:09:59,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:09:59,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:09:59,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:09:59,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:09:59,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:09:59,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:09:59,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:09:59,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:09:59,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:09:59,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:09:59,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:09:59,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:09:59,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:09:59,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:09:59,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:09:59,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:09:59,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:09:59,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:09:59,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:09:59,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:09:59,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:09:59,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:09:59,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:09:59,123 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:09:59,124 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:09:59,125 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-09-08 08:09:59,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f8bd62b/e3376d891778483ca84661f3925398c0/FLAG216d7d155 [2019-09-08 08:09:59,799 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:09:59,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-09-08 08:09:59,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f8bd62b/e3376d891778483ca84661f3925398c0/FLAG216d7d155 [2019-09-08 08:10:00,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f8bd62b/e3376d891778483ca84661f3925398c0 [2019-09-08 08:10:00,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:10:00,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:10:00,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:10:00,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:10:00,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:10:00,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1460d7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00, skipping insertion in model container [2019-09-08 08:10:00,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,131 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:10:00,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:10:00,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:10:00,518 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:10:00,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:10:00,719 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:10:00,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00 WrapperNode [2019-09-08 08:10:00,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:10:00,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:10:00,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:10:00,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:10:00,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... [2019-09-08 08:10:00,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:10:00,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:10:00,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:10:00,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:10:00,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:10:00,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:10:00,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:10:00,854 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:10:00,854 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:10:00,854 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:10:00,855 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:10:00,855 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:10:00,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:10:00,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:10:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:10:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:10:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:10:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:10:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:10:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:10:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:10:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:10:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:10:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:10:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:10:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:10:00,857 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:10:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:10:00,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:10:01,641 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:10:01,642 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:10:01,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:10:01 BoogieIcfgContainer [2019-09-08 08:10:01,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:10:01,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:10:01,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:10:01,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:10:01,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:10:00" (1/3) ... [2019-09-08 08:10:01,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271a8348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:10:01, skipping insertion in model container [2019-09-08 08:10:01,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:10:00" (2/3) ... [2019-09-08 08:10:01,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271a8348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:10:01, skipping insertion in model container [2019-09-08 08:10:01,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:10:01" (3/3) ... [2019-09-08 08:10:01,654 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2019-09-08 08:10:01,667 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:10:01,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:10:01,697 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:10:01,750 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:10:01,751 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:10:01,752 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:10:01,752 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:10:01,754 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:10:01,754 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:10:01,754 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:10:01,754 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:10:01,754 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:10:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-09-08 08:10:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 08:10:01,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:01,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:01,820 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash -138363202, now seen corresponding path program 1 times [2019-09-08 08:10:01,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:01,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:01,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:02,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-09-08 08:10:02,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:02,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:02,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:02,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:02,346 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 5 states. [2019-09-08 08:10:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:02,463 INFO L93 Difference]: Finished difference Result 268 states and 423 transitions. [2019-09-08 08:10:02,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:10:02,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 08:10:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:02,479 INFO L225 Difference]: With dead ends: 268 [2019-09-08 08:10:02,479 INFO L226 Difference]: Without dead ends: 157 [2019-09-08 08:10:02,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:10:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-08 08:10:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-09-08 08:10:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-08 08:10:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 229 transitions. [2019-09-08 08:10:02,541 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 229 transitions. Word has length 59 [2019-09-08 08:10:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:02,542 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 229 transitions. [2019-09-08 08:10:02,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 229 transitions. [2019-09-08 08:10:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 08:10:02,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:02,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:02,547 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash -729264269, now seen corresponding path program 1 times [2019-09-08 08:10:02,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:02,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:02,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:02,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:02,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:02,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:02,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:02,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:02,796 INFO L87 Difference]: Start difference. First operand 157 states and 229 transitions. Second operand 5 states. [2019-09-08 08:10:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:03,361 INFO L93 Difference]: Finished difference Result 353 states and 532 transitions. [2019-09-08 08:10:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:10:03,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 08:10:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:03,368 INFO L225 Difference]: With dead ends: 353 [2019-09-08 08:10:03,368 INFO L226 Difference]: Without dead ends: 256 [2019-09-08 08:10:03,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:10:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-08 08:10:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 244. [2019-09-08 08:10:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-08 08:10:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 359 transitions. [2019-09-08 08:10:03,399 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 359 transitions. Word has length 82 [2019-09-08 08:10:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:03,400 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 359 transitions. [2019-09-08 08:10:03,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 359 transitions. [2019-09-08 08:10:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 08:10:03,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:03,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:03,404 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash 440180648, now seen corresponding path program 1 times [2019-09-08 08:10:03,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:03,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:03,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:03,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:03,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:03,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:03,612 INFO L87 Difference]: Start difference. First operand 244 states and 359 transitions. Second operand 5 states. [2019-09-08 08:10:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:04,221 INFO L93 Difference]: Finished difference Result 606 states and 907 transitions. [2019-09-08 08:10:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:10:04,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-08 08:10:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:04,232 INFO L225 Difference]: With dead ends: 606 [2019-09-08 08:10:04,232 INFO L226 Difference]: Without dead ends: 422 [2019-09-08 08:10:04,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:10:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-08 08:10:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2019-09-08 08:10:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-09-08 08:10:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 615 transitions. [2019-09-08 08:10:04,315 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 615 transitions. Word has length 84 [2019-09-08 08:10:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:04,316 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 615 transitions. [2019-09-08 08:10:04,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 615 transitions. [2019-09-08 08:10:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 08:10:04,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:04,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:04,325 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1329009395, now seen corresponding path program 1 times [2019-09-08 08:10:04,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:04,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:04,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:04,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:04,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:04,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:04,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:04,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:04,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:04,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:04,481 INFO L87 Difference]: Start difference. First operand 414 states and 615 transitions. Second operand 5 states. [2019-09-08 08:10:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:05,044 INFO L93 Difference]: Finished difference Result 1110 states and 1661 transitions. [2019-09-08 08:10:05,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:10:05,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 08:10:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:05,057 INFO L225 Difference]: With dead ends: 1110 [2019-09-08 08:10:05,057 INFO L226 Difference]: Without dead ends: 756 [2019-09-08 08:10:05,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:10:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-08 08:10:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 742. [2019-09-08 08:10:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-09-08 08:10:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1103 transitions. [2019-09-08 08:10:05,134 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1103 transitions. Word has length 86 [2019-09-08 08:10:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:05,135 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 1103 transitions. [2019-09-08 08:10:05,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1103 transitions. [2019-09-08 08:10:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 08:10:05,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:05,139 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:05,139 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1421684696, now seen corresponding path program 1 times [2019-09-08 08:10:05,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:05,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:05,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:05,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:05,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:10:05,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:10:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:10:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:10:05,369 INFO L87 Difference]: Start difference. First operand 742 states and 1103 transitions. Second operand 9 states. [2019-09-08 08:10:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:07,608 INFO L93 Difference]: Finished difference Result 3193 states and 4896 transitions. [2019-09-08 08:10:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 08:10:07,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 08:10:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:07,629 INFO L225 Difference]: With dead ends: 3193 [2019-09-08 08:10:07,630 INFO L226 Difference]: Without dead ends: 2511 [2019-09-08 08:10:07,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-09-08 08:10:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2019-09-08 08:10:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2037. [2019-09-08 08:10:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-09-08 08:10:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 3099 transitions. [2019-09-08 08:10:07,808 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 3099 transitions. Word has length 88 [2019-09-08 08:10:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:07,809 INFO L475 AbstractCegarLoop]: Abstraction has 2037 states and 3099 transitions. [2019-09-08 08:10:07,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:10:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3099 transitions. [2019-09-08 08:10:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 08:10:07,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:07,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:07,814 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:07,814 INFO L82 PathProgramCache]: Analyzing trace with hash 725843412, now seen corresponding path program 1 times [2019-09-08 08:10:07,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:07,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:07,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:07,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:07,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:07,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:10:07,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:10:07,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:10:07,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:10:07,975 INFO L87 Difference]: Start difference. First operand 2037 states and 3099 transitions. Second operand 6 states. [2019-09-08 08:10:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:08,774 INFO L93 Difference]: Finished difference Result 4815 states and 7364 transitions. [2019-09-08 08:10:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:10:08,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 08:10:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:08,792 INFO L225 Difference]: With dead ends: 4815 [2019-09-08 08:10:08,792 INFO L226 Difference]: Without dead ends: 2838 [2019-09-08 08:10:08,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:10:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-09-08 08:10:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2792. [2019-09-08 08:10:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2792 states. [2019-09-08 08:10:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4259 transitions. [2019-09-08 08:10:08,952 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4259 transitions. Word has length 89 [2019-09-08 08:10:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:08,952 INFO L475 AbstractCegarLoop]: Abstraction has 2792 states and 4259 transitions. [2019-09-08 08:10:08,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:10:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4259 transitions. [2019-09-08 08:10:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:10:08,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:08,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:08,958 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:08,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:08,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1668068831, now seen corresponding path program 1 times [2019-09-08 08:10:08,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:08,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:08,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:08,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:09,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:09,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:10:09,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:10:09,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:10:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:10:09,119 INFO L87 Difference]: Start difference. First operand 2792 states and 4259 transitions. Second operand 6 states. [2019-09-08 08:10:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:09,758 INFO L93 Difference]: Finished difference Result 4458 states and 6841 transitions. [2019-09-08 08:10:09,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:09,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 08:10:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:09,776 INFO L225 Difference]: With dead ends: 4458 [2019-09-08 08:10:09,776 INFO L226 Difference]: Without dead ends: 3132 [2019-09-08 08:10:09,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:10:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2019-09-08 08:10:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 2806. [2019-09-08 08:10:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2019-09-08 08:10:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4265 transitions. [2019-09-08 08:10:09,969 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4265 transitions. Word has length 90 [2019-09-08 08:10:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:09,969 INFO L475 AbstractCegarLoop]: Abstraction has 2806 states and 4265 transitions. [2019-09-08 08:10:09,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:10:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4265 transitions. [2019-09-08 08:10:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:10:09,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:09,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:09,975 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -39681423, now seen corresponding path program 1 times [2019-09-08 08:10:09,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:09,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:09,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:10,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:10,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:10:10,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:10:10,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:10:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:10:10,181 INFO L87 Difference]: Start difference. First operand 2806 states and 4265 transitions. Second operand 9 states. [2019-09-08 08:10:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:12,236 INFO L93 Difference]: Finished difference Result 4815 states and 7387 transitions. [2019-09-08 08:10:12,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 08:10:12,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-08 08:10:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:12,265 INFO L225 Difference]: With dead ends: 4815 [2019-09-08 08:10:12,265 INFO L226 Difference]: Without dead ends: 3854 [2019-09-08 08:10:12,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-09-08 08:10:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2019-09-08 08:10:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3741. [2019-09-08 08:10:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3741 states. [2019-09-08 08:10:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5717 transitions. [2019-09-08 08:10:12,486 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5717 transitions. Word has length 90 [2019-09-08 08:10:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:12,486 INFO L475 AbstractCegarLoop]: Abstraction has 3741 states and 5717 transitions. [2019-09-08 08:10:12,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:10:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5717 transitions. [2019-09-08 08:10:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:10:12,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:12,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:12,491 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:12,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1471946913, now seen corresponding path program 1 times [2019-09-08 08:10:12,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:12,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:12,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:12,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:12,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:10:12,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:10:12,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:10:12,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:10:12,649 INFO L87 Difference]: Start difference. First operand 3741 states and 5717 transitions. Second operand 6 states. [2019-09-08 08:10:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:13,754 INFO L93 Difference]: Finished difference Result 11051 states and 16936 transitions. [2019-09-08 08:10:13,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:10:13,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 08:10:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:13,796 INFO L225 Difference]: With dead ends: 11051 [2019-09-08 08:10:13,796 INFO L226 Difference]: Without dead ends: 7370 [2019-09-08 08:10:13,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:10:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2019-09-08 08:10:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 7289. [2019-09-08 08:10:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7289 states. [2019-09-08 08:10:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7289 states to 7289 states and 11080 transitions. [2019-09-08 08:10:14,134 INFO L78 Accepts]: Start accepts. Automaton has 7289 states and 11080 transitions. Word has length 90 [2019-09-08 08:10:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:14,135 INFO L475 AbstractCegarLoop]: Abstraction has 7289 states and 11080 transitions. [2019-09-08 08:10:14,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:10:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7289 states and 11080 transitions. [2019-09-08 08:10:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:10:14,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:14,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:14,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 692228575, now seen corresponding path program 1 times [2019-09-08 08:10:14,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:14,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:14,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:14,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:14,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:10:14,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:10:14,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:10:14,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:10:14,317 INFO L87 Difference]: Start difference. First operand 7289 states and 11080 transitions. Second operand 9 states. [2019-09-08 08:10:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:16,347 INFO L93 Difference]: Finished difference Result 12635 states and 19308 transitions. [2019-09-08 08:10:16,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 08:10:16,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-08 08:10:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:16,406 INFO L225 Difference]: With dead ends: 12635 [2019-09-08 08:10:16,407 INFO L226 Difference]: Without dead ends: 9044 [2019-09-08 08:10:16,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2019-09-08 08:10:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9044 states. [2019-09-08 08:10:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9044 to 8803. [2019-09-08 08:10:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8803 states. [2019-09-08 08:10:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8803 states to 8803 states and 13418 transitions. [2019-09-08 08:10:16,836 INFO L78 Accepts]: Start accepts. Automaton has 8803 states and 13418 transitions. Word has length 90 [2019-09-08 08:10:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:16,837 INFO L475 AbstractCegarLoop]: Abstraction has 8803 states and 13418 transitions. [2019-09-08 08:10:16,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:10:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8803 states and 13418 transitions. [2019-09-08 08:10:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 08:10:16,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:16,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:16,841 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash -935655189, now seen corresponding path program 1 times [2019-09-08 08:10:16,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:16,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:16,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:16,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:10:16,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:10:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:10:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:10:16,995 INFO L87 Difference]: Start difference. First operand 8803 states and 13418 transitions. Second operand 6 states. [2019-09-08 08:10:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:18,481 INFO L93 Difference]: Finished difference Result 26610 states and 40712 transitions. [2019-09-08 08:10:18,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:10:18,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 08:10:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:18,564 INFO L225 Difference]: With dead ends: 26610 [2019-09-08 08:10:18,565 INFO L226 Difference]: Without dead ends: 17867 [2019-09-08 08:10:18,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:10:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17867 states. [2019-09-08 08:10:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17867 to 17635. [2019-09-08 08:10:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17635 states. [2019-09-08 08:10:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17635 states to 17635 states and 26938 transitions. [2019-09-08 08:10:19,236 INFO L78 Accepts]: Start accepts. Automaton has 17635 states and 26938 transitions. Word has length 91 [2019-09-08 08:10:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:19,237 INFO L475 AbstractCegarLoop]: Abstraction has 17635 states and 26938 transitions. [2019-09-08 08:10:19,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:10:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17635 states and 26938 transitions. [2019-09-08 08:10:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:10:19,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:19,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:19,242 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:19,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1411532010, now seen corresponding path program 1 times [2019-09-08 08:10:19,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:19,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:19,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:19,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:19,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:19,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:10:19,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:10:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:10:19,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:10:19,335 INFO L87 Difference]: Start difference. First operand 17635 states and 26938 transitions. Second operand 7 states. [2019-09-08 08:10:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:21,129 INFO L93 Difference]: Finished difference Result 32363 states and 49710 transitions. [2019-09-08 08:10:21,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:10:21,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-09-08 08:10:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:21,235 INFO L225 Difference]: With dead ends: 32363 [2019-09-08 08:10:21,236 INFO L226 Difference]: Without dead ends: 19460 [2019-09-08 08:10:21,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:10:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19460 states. [2019-09-08 08:10:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19460 to 15328. [2019-09-08 08:10:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-09-08 08:10:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 23430 transitions. [2019-09-08 08:10:22,156 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 23430 transitions. Word has length 92 [2019-09-08 08:10:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:22,156 INFO L475 AbstractCegarLoop]: Abstraction has 15328 states and 23430 transitions. [2019-09-08 08:10:22,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:10:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 23430 transitions. [2019-09-08 08:10:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:10:22,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:22,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:22,162 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash -511696024, now seen corresponding path program 1 times [2019-09-08 08:10:22,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:22,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:22,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:22,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:22,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:22,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:22,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 08:10:22,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 08:10:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 08:10:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:10:22,363 INFO L87 Difference]: Start difference. First operand 15328 states and 23430 transitions. Second operand 10 states. [2019-09-08 08:10:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:24,799 INFO L93 Difference]: Finished difference Result 23420 states and 35766 transitions. [2019-09-08 08:10:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 08:10:24,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 08:10:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:24,850 INFO L225 Difference]: With dead ends: 23420 [2019-09-08 08:10:24,851 INFO L226 Difference]: Without dead ends: 16449 [2019-09-08 08:10:24,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-08 08:10:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2019-09-08 08:10:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 16443. [2019-09-08 08:10:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16443 states. [2019-09-08 08:10:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16443 states to 16443 states and 25112 transitions. [2019-09-08 08:10:25,530 INFO L78 Accepts]: Start accepts. Automaton has 16443 states and 25112 transitions. Word has length 92 [2019-09-08 08:10:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:25,530 INFO L475 AbstractCegarLoop]: Abstraction has 16443 states and 25112 transitions. [2019-09-08 08:10:25,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 08:10:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16443 states and 25112 transitions. [2019-09-08 08:10:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:10:25,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:25,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:25,535 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1652479464, now seen corresponding path program 1 times [2019-09-08 08:10:25,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:25,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:25,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:25,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:25,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:10:25,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:10:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:10:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:10:25,725 INFO L87 Difference]: Start difference. First operand 16443 states and 25112 transitions. Second operand 6 states. [2019-09-08 08:10:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:26,872 INFO L93 Difference]: Finished difference Result 28630 states and 43770 transitions. [2019-09-08 08:10:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:10:26,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-09-08 08:10:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:26,925 INFO L225 Difference]: With dead ends: 28630 [2019-09-08 08:10:26,925 INFO L226 Difference]: Without dead ends: 16931 [2019-09-08 08:10:26,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:10:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16931 states. [2019-09-08 08:10:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16931 to 16443. [2019-09-08 08:10:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16443 states. [2019-09-08 08:10:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16443 states to 16443 states and 25060 transitions. [2019-09-08 08:10:27,577 INFO L78 Accepts]: Start accepts. Automaton has 16443 states and 25060 transitions. Word has length 92 [2019-09-08 08:10:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:27,577 INFO L475 AbstractCegarLoop]: Abstraction has 16443 states and 25060 transitions. [2019-09-08 08:10:27,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:10:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16443 states and 25060 transitions. [2019-09-08 08:10:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 08:10:27,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:27,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:27,580 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -441268413, now seen corresponding path program 1 times [2019-09-08 08:10:27,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:27,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:27,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:27,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:27,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:27,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:27,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:27,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:27,685 INFO L87 Difference]: Start difference. First operand 16443 states and 25060 transitions. Second operand 5 states. [2019-09-08 08:10:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:28,625 INFO L93 Difference]: Finished difference Result 48617 states and 75271 transitions. [2019-09-08 08:10:28,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:28,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 08:10:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:28,742 INFO L225 Difference]: With dead ends: 48617 [2019-09-08 08:10:28,742 INFO L226 Difference]: Without dead ends: 32188 [2019-09-08 08:10:28,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:10:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32188 states. [2019-09-08 08:10:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32188 to 32186. [2019-09-08 08:10:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32186 states. [2019-09-08 08:10:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32186 states to 32186 states and 48245 transitions. [2019-09-08 08:10:30,222 INFO L78 Accepts]: Start accepts. Automaton has 32186 states and 48245 transitions. Word has length 93 [2019-09-08 08:10:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:30,222 INFO L475 AbstractCegarLoop]: Abstraction has 32186 states and 48245 transitions. [2019-09-08 08:10:30,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 32186 states and 48245 transitions. [2019-09-08 08:10:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 08:10:30,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:30,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:30,227 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1196132614, now seen corresponding path program 1 times [2019-09-08 08:10:30,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:30,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:30,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:30,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:30,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:30,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:30,340 INFO L87 Difference]: Start difference. First operand 32186 states and 48245 transitions. Second operand 5 states. [2019-09-08 08:10:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:32,617 INFO L93 Difference]: Finished difference Result 95150 states and 144593 transitions. [2019-09-08 08:10:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:10:32,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 08:10:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:32,773 INFO L225 Difference]: With dead ends: 95150 [2019-09-08 08:10:32,774 INFO L226 Difference]: Without dead ends: 62996 [2019-09-08 08:10:32,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:10:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62996 states. [2019-09-08 08:10:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62996 to 62994. [2019-09-08 08:10:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62994 states. [2019-09-08 08:10:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62994 states to 62994 states and 92827 transitions. [2019-09-08 08:10:35,320 INFO L78 Accepts]: Start accepts. Automaton has 62994 states and 92827 transitions. Word has length 94 [2019-09-08 08:10:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:35,321 INFO L475 AbstractCegarLoop]: Abstraction has 62994 states and 92827 transitions. [2019-09-08 08:10:35,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 62994 states and 92827 transitions. [2019-09-08 08:10:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:10:35,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:35,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:35,328 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1703142704, now seen corresponding path program 1 times [2019-09-08 08:10:35,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:35,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:35,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:35,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:35,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:35,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:10:35,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:10:35,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:10:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:10:35,416 INFO L87 Difference]: Start difference. First operand 62994 states and 92827 transitions. Second operand 5 states. [2019-09-08 08:10:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:40,025 INFO L93 Difference]: Finished difference Result 174698 states and 259617 transitions. [2019-09-08 08:10:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:10:40,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 08:10:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:40,327 INFO L225 Difference]: With dead ends: 174698 [2019-09-08 08:10:40,328 INFO L226 Difference]: Without dead ends: 111892 [2019-09-08 08:10:40,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:10:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111892 states. [2019-09-08 08:10:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111892 to 107690. [2019-09-08 08:10:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107690 states. [2019-09-08 08:10:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107690 states to 107690 states and 159071 transitions. [2019-09-08 08:10:46,247 INFO L78 Accepts]: Start accepts. Automaton has 107690 states and 159071 transitions. Word has length 95 [2019-09-08 08:10:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:46,248 INFO L475 AbstractCegarLoop]: Abstraction has 107690 states and 159071 transitions. [2019-09-08 08:10:46,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:10:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 107690 states and 159071 transitions. [2019-09-08 08:10:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:10:46,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:46,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:46,255 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash -502362974, now seen corresponding path program 1 times [2019-09-08 08:10:46,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:46,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:46,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:46,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:46,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:10:46,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:10:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:10:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:10:46,295 INFO L87 Difference]: Start difference. First operand 107690 states and 159071 transitions. Second operand 3 states. [2019-09-08 08:10:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:49,666 INFO L93 Difference]: Finished difference Result 160570 states and 236874 transitions. [2019-09-08 08:10:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:10:49,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 08:10:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:49,975 INFO L225 Difference]: With dead ends: 160570 [2019-09-08 08:10:49,975 INFO L226 Difference]: Without dead ends: 107838 [2019-09-08 08:10:50,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:10:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107838 states. [2019-09-08 08:10:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107838 to 107694. [2019-09-08 08:10:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107694 states. [2019-09-08 08:10:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107694 states to 107694 states and 159075 transitions. [2019-09-08 08:10:56,199 INFO L78 Accepts]: Start accepts. Automaton has 107694 states and 159075 transitions. Word has length 95 [2019-09-08 08:10:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:10:56,199 INFO L475 AbstractCegarLoop]: Abstraction has 107694 states and 159075 transitions. [2019-09-08 08:10:56,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:10:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 107694 states and 159075 transitions. [2019-09-08 08:10:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:10:56,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:10:56,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:10:56,205 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:10:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:10:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1652601859, now seen corresponding path program 1 times [2019-09-08 08:10:56,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:10:56,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:10:56,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:56,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:10:56,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:10:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:10:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:10:56,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:10:56,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:10:56,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:10:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:10:56,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:10:56,246 INFO L87 Difference]: Start difference. First operand 107694 states and 159075 transitions. Second operand 3 states. [2019-09-08 08:10:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:10:59,274 INFO L93 Difference]: Finished difference Result 160759 states and 237406 transitions. [2019-09-08 08:10:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:10:59,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 08:10:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:10:59,589 INFO L225 Difference]: With dead ends: 160759 [2019-09-08 08:10:59,590 INFO L226 Difference]: Without dead ends: 107866 [2019-09-08 08:10:59,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:10:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107866 states. [2019-09-08 08:11:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107866 to 107696. [2019-09-08 08:11:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107696 states. [2019-09-08 08:11:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107696 states to 107696 states and 159077 transitions. [2019-09-08 08:11:05,998 INFO L78 Accepts]: Start accepts. Automaton has 107696 states and 159077 transitions. Word has length 95 [2019-09-08 08:11:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:05,998 INFO L475 AbstractCegarLoop]: Abstraction has 107696 states and 159077 transitions. [2019-09-08 08:11:05,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:11:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 107696 states and 159077 transitions. [2019-09-08 08:11:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:11:06,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:06,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:11:06,005 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1219570006, now seen corresponding path program 1 times [2019-09-08 08:11:06,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:11:06,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:06,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:11:06,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:11:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:11:06,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:11:06,165 INFO L87 Difference]: Start difference. First operand 107696 states and 159077 transitions. Second operand 11 states. [2019-09-08 08:11:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:13,375 INFO L93 Difference]: Finished difference Result 291428 states and 439887 transitions. [2019-09-08 08:11:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:11:13,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-09-08 08:11:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:14,031 INFO L225 Difference]: With dead ends: 291428 [2019-09-08 08:11:14,032 INFO L226 Difference]: Without dead ends: 208432 [2019-09-08 08:11:17,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:11:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208432 states. [2019-09-08 08:11:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208432 to 180718. [2019-09-08 08:11:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180718 states. [2019-09-08 08:11:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180718 states to 180718 states and 269453 transitions. [2019-09-08 08:11:24,495 INFO L78 Accepts]: Start accepts. Automaton has 180718 states and 269453 transitions. Word has length 96 [2019-09-08 08:11:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:11:24,496 INFO L475 AbstractCegarLoop]: Abstraction has 180718 states and 269453 transitions. [2019-09-08 08:11:24,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:11:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 180718 states and 269453 transitions. [2019-09-08 08:11:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:11:24,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:11:24,502 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:11:24,502 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:11:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:11:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2116963284, now seen corresponding path program 1 times [2019-09-08 08:11:24,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:11:24,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:11:24,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:24,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:11:24,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:11:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:11:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:11:24,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:11:24,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:11:24,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:11:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:11:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:11:24,595 INFO L87 Difference]: Start difference. First operand 180718 states and 269453 transitions. Second operand 5 states. [2019-09-08 08:11:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:11:40,087 INFO L93 Difference]: Finished difference Result 510530 states and 767049 transitions. [2019-09-08 08:11:40,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:11:40,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:11:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:11:41,797 INFO L225 Difference]: With dead ends: 510530 [2019-09-08 08:11:41,797 INFO L226 Difference]: Without dead ends: 330476 [2019-09-08 08:11:42,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:11:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330476 states. [2019-09-08 08:12:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330476 to 317034. [2019-09-08 08:12:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317034 states. [2019-09-08 08:12:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317034 states to 317034 states and 473527 transitions. [2019-09-08 08:12:03,739 INFO L78 Accepts]: Start accepts. Automaton has 317034 states and 473527 transitions. Word has length 96 [2019-09-08 08:12:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:03,739 INFO L475 AbstractCegarLoop]: Abstraction has 317034 states and 473527 transitions. [2019-09-08 08:12:03,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:12:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 317034 states and 473527 transitions. [2019-09-08 08:12:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:12:03,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:03,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:12:03,746 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1709365490, now seen corresponding path program 1 times [2019-09-08 08:12:03,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:03,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:12:03,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:03,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:12:03,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:12:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:12:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:12:03,840 INFO L87 Difference]: Start difference. First operand 317034 states and 473527 transitions. Second operand 5 states. [2019-09-08 08:12:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:26,503 INFO L93 Difference]: Finished difference Result 731426 states and 1103015 transitions. [2019-09-08 08:12:26,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:12:26,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:12:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:27,875 INFO L225 Difference]: With dead ends: 731426 [2019-09-08 08:12:27,875 INFO L226 Difference]: Without dead ends: 435924 [2019-09-08 08:12:28,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:12:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435924 states. [2019-09-08 08:13:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435924 to 435910. [2019-09-08 08:13:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435910 states. [2019-09-08 08:13:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435910 states to 435910 states and 651513 transitions. [2019-09-08 08:13:05,403 INFO L78 Accepts]: Start accepts. Automaton has 435910 states and 651513 transitions. Word has length 96 [2019-09-08 08:13:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:05,404 INFO L475 AbstractCegarLoop]: Abstraction has 435910 states and 651513 transitions. [2019-09-08 08:13:05,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 435910 states and 651513 transitions. [2019-09-08 08:13:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:05,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:05,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:05,408 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash -204132719, now seen corresponding path program 1 times [2019-09-08 08:13:05,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:05,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:05,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:05,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:13:05,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:05,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:05,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:05,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:05,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:05,508 INFO L87 Difference]: Start difference. First operand 435910 states and 651513 transitions. Second operand 5 states. [2019-09-08 08:13:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:59,681 INFO L93 Difference]: Finished difference Result 1287954 states and 1964462 transitions. [2019-09-08 08:13:59,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:13:59,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:13:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:03,725 INFO L225 Difference]: With dead ends: 1287954 [2019-09-08 08:14:03,725 INFO L226 Difference]: Without dead ends: 852108 [2019-09-08 08:14:04,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:14:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852108 states. [2019-09-08 08:15:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852108 to 852106. [2019-09-08 08:15:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852106 states. [2019-09-08 08:15:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852106 states to 852106 states and 1252660 transitions. [2019-09-08 08:15:17,093 INFO L78 Accepts]: Start accepts. Automaton has 852106 states and 1252660 transitions. Word has length 96 [2019-09-08 08:15:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:17,093 INFO L475 AbstractCegarLoop]: Abstraction has 852106 states and 1252660 transitions. [2019-09-08 08:15:17,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:15:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 852106 states and 1252660 transitions. [2019-09-08 08:15:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:15:17,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:17,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:15:17,099 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -207384882, now seen corresponding path program 1 times [2019-09-08 08:15:17,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:17,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:15:17,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:17,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 08:15:17,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 08:15:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 08:15:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:15:17,238 INFO L87 Difference]: Start difference. First operand 852106 states and 1252660 transitions. Second operand 10 states. [2019-09-08 08:16:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:16:43,564 INFO L93 Difference]: Finished difference Result 1584180 states and 2348721 transitions. [2019-09-08 08:16:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 08:16:43,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 08:16:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:16:49,105 INFO L225 Difference]: With dead ends: 1584180 [2019-09-08 08:16:49,106 INFO L226 Difference]: Without dead ends: 1370346 [2019-09-08 08:16:49,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=846, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 08:16:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370346 states.