java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:20:07,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:20:07,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:20:07,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:20:07,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:20:07,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:20:07,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:20:07,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:20:07,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:20:07,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:20:07,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:20:07,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:20:07,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:20:07,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:20:07,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:20:07,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:20:07,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:20:07,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:20:07,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:20:07,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:20:07,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:20:07,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:20:07,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:20:07,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:20:07,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:20:07,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:20:07,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:20:07,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:20:07,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:20:07,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:20:07,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:20:07,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:20:07,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:20:07,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:20:07,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:20:07,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:20:07,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:20:07,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:20:07,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:20:07,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:20:07,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:20:07,954 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 13:20:07,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:20:07,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:20:07,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:20:07,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:20:07,977 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:20:07,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:20:07,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:20:07,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:20:07,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:20:07,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:20:07,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:20:07,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:20:07,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:20:07,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:20:07,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:20:07,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:20:07,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:20:07,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:20:07,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:20:07,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:20:07,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:20:07,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:20:07,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:20:07,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:20:07,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:20:07,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:20:07,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:20:07,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:20:07,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:20:08,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:20:08,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:20:08,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:20:08,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:20:08,038 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:20:08,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:20:08,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7417d163/faaafd70481c473a879c88d56a491233/FLAGe2472fe02 [2019-09-08 13:20:08,672 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:20:08,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:20:08,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7417d163/faaafd70481c473a879c88d56a491233/FLAGe2472fe02 [2019-09-08 13:20:08,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7417d163/faaafd70481c473a879c88d56a491233 [2019-09-08 13:20:08,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:20:08,925 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:20:08,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:20:08,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:20:08,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:20:08,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:20:08" (1/1) ... [2019-09-08 13:20:08,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3823e294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:08, skipping insertion in model container [2019-09-08 13:20:08,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:20:08" (1/1) ... [2019-09-08 13:20:08,942 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:20:09,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:20:09,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:20:09,563 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:20:09,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:20:09,756 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:20:09,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09 WrapperNode [2019-09-08 13:20:09,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:20:09,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:20:09,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:20:09,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:20:09,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (1/1) ... [2019-09-08 13:20:09,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:20:09,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:20:09,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:20:09,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:20:09,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (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 13:20:09,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:20:09,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:20:09,945 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:20:09,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:20:09,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:20:09,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:20:09,947 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:20:09,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:20:09,948 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:20:09,948 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:20:09,948 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:20:09,948 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:20:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:20:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:20:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:20:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:20:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:20:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:20:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:20:11,398 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:20:11,399 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:20:11,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:20:11 BoogieIcfgContainer [2019-09-08 13:20:11,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:20:11,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:20:11,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:20:11,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:20:11,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:20:08" (1/3) ... [2019-09-08 13:20:11,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f176ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:20:11, skipping insertion in model container [2019-09-08 13:20:11,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:20:09" (2/3) ... [2019-09-08 13:20:11,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f176ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:20:11, skipping insertion in model container [2019-09-08 13:20:11,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:20:11" (3/3) ... [2019-09-08 13:20:11,413 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:20:11,425 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:20:11,453 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:20:11,472 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:20:11,517 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:20:11,518 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:20:11,519 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:20:11,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:20:11,519 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:20:11,520 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:20:11,520 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:20:11,520 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:20:11,520 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:20:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-08 13:20:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:20:11,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:11,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:11,591 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -35123060, now seen corresponding path program 1 times [2019-09-08 13:20:11,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:11,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:11,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:11,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:12,171 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 13:20:12,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:12,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:12,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:12,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:12,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:12,196 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 3 states. [2019-09-08 13:20:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:12,355 INFO L93 Difference]: Finished difference Result 635 states and 1098 transitions. [2019-09-08 13:20:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:12,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 13:20:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:12,385 INFO L225 Difference]: With dead ends: 635 [2019-09-08 13:20:12,385 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 13:20:12,392 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 13:20:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 13:20:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2019-09-08 13:20:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-08 13:20:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 783 transitions. [2019-09-08 13:20:12,529 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 783 transitions. Word has length 122 [2019-09-08 13:20:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:12,530 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 783 transitions. [2019-09-08 13:20:12,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 783 transitions. [2019-09-08 13:20:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:20:12,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:12,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:12,534 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash 993718675, now seen corresponding path program 1 times [2019-09-08 13:20:12,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:12,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:12,782 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 13:20:12,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:12,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:12,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:12,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:12,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:12,786 INFO L87 Difference]: Start difference. First operand 475 states and 783 transitions. Second operand 3 states. [2019-09-08 13:20:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:12,838 INFO L93 Difference]: Finished difference Result 1011 states and 1679 transitions. [2019-09-08 13:20:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:12,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:20:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:12,844 INFO L225 Difference]: With dead ends: 1011 [2019-09-08 13:20:12,844 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 13:20:12,847 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 13:20:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 13:20:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2019-09-08 13:20:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-08 13:20:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1210 transitions. [2019-09-08 13:20:12,881 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1210 transitions. Word has length 125 [2019-09-08 13:20:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:12,882 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1210 transitions. [2019-09-08 13:20:12,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1210 transitions. [2019-09-08 13:20:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:20:12,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:12,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:12,885 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1625513079, now seen corresponding path program 1 times [2019-09-08 13:20:12,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:12,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:20:13,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:13,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:13,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:13,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:13,025 INFO L87 Difference]: Start difference. First operand 731 states and 1210 transitions. Second operand 3 states. [2019-09-08 13:20:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:13,082 INFO L93 Difference]: Finished difference Result 1759 states and 2924 transitions. [2019-09-08 13:20:13,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:13,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 13:20:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:13,094 INFO L225 Difference]: With dead ends: 1759 [2019-09-08 13:20:13,094 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 13:20:13,096 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 13:20:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 13:20:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2019-09-08 13:20:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-08 13:20:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2026 transitions. [2019-09-08 13:20:13,156 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2026 transitions. Word has length 128 [2019-09-08 13:20:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:13,157 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 2026 transitions. [2019-09-08 13:20:13,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2026 transitions. [2019-09-08 13:20:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:20:13,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:13,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:13,162 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash 649173988, now seen corresponding path program 1 times [2019-09-08 13:20:13,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:13,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:13,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:13,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:13,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:13,360 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 13:20:13,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:13,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:13,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:13,362 INFO L87 Difference]: Start difference. First operand 1223 states and 2026 transitions. Second operand 3 states. [2019-09-08 13:20:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:13,450 INFO L93 Difference]: Finished difference Result 3195 states and 5300 transitions. [2019-09-08 13:20:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:13,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 13:20:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:13,466 INFO L225 Difference]: With dead ends: 3195 [2019-09-08 13:20:13,466 INFO L226 Difference]: Without dead ends: 2169 [2019-09-08 13:20:13,469 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 13:20:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-08 13:20:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2167. [2019-09-08 13:20:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-09-08 13:20:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3582 transitions. [2019-09-08 13:20:13,562 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3582 transitions. Word has length 131 [2019-09-08 13:20:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:13,563 INFO L475 AbstractCegarLoop]: Abstraction has 2167 states and 3582 transitions. [2019-09-08 13:20:13,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3582 transitions. [2019-09-08 13:20:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 13:20:13,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:13,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:13,570 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1855611538, now seen corresponding path program 1 times [2019-09-08 13:20:13,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:13,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:20:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:13,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:20:13,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:20:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:20:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:20:13,845 INFO L87 Difference]: Start difference. First operand 2167 states and 3582 transitions. Second operand 6 states. [2019-09-08 13:20:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:14,351 INFO L93 Difference]: Finished difference Result 8233 states and 13695 transitions. [2019-09-08 13:20:14,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:20:14,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 13:20:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:14,384 INFO L225 Difference]: With dead ends: 8233 [2019-09-08 13:20:14,384 INFO L226 Difference]: Without dead ends: 6263 [2019-09-08 13:20:14,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:20:14,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-08 13:20:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 4929. [2019-09-08 13:20:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4929 states. [2019-09-08 13:20:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8167 transitions. [2019-09-08 13:20:14,688 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8167 transitions. Word has length 134 [2019-09-08 13:20:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:14,689 INFO L475 AbstractCegarLoop]: Abstraction has 4929 states and 8167 transitions. [2019-09-08 13:20:14,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:20:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8167 transitions. [2019-09-08 13:20:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 13:20:14,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:14,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:14,694 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:14,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551114, now seen corresponding path program 1 times [2019-09-08 13:20:14,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:14,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:14,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:14,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:14,897 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 13:20:14,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:14,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:14,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:14,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:14,899 INFO L87 Difference]: Start difference. First operand 4929 states and 8167 transitions. Second operand 4 states. [2019-09-08 13:20:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:15,338 INFO L93 Difference]: Finished difference Result 13059 states and 21734 transitions. [2019-09-08 13:20:15,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:15,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 13:20:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:15,391 INFO L225 Difference]: With dead ends: 13059 [2019-09-08 13:20:15,392 INFO L226 Difference]: Without dead ends: 8327 [2019-09-08 13:20:15,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-09-08 13:20:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7273. [2019-09-08 13:20:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-08 13:20:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 12070 transitions. [2019-09-08 13:20:15,885 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 12070 transitions. Word has length 135 [2019-09-08 13:20:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:15,887 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 12070 transitions. [2019-09-08 13:20:15,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:20:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 12070 transitions. [2019-09-08 13:20:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:20:15,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:15,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:15,893 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:15,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1365624242, now seen corresponding path program 1 times [2019-09-08 13:20:15,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:15,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:15,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:15,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:16,009 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 13:20:16,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:16,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:16,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:16,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:16,011 INFO L87 Difference]: Start difference. First operand 7273 states and 12070 transitions. Second operand 3 states. [2019-09-08 13:20:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:16,576 INFO L93 Difference]: Finished difference Result 16045 states and 26759 transitions. [2019-09-08 13:20:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:16,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:20:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:16,622 INFO L225 Difference]: With dead ends: 16045 [2019-09-08 13:20:16,622 INFO L226 Difference]: Without dead ends: 11099 [2019-09-08 13:20:16,634 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 13:20:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2019-09-08 13:20:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 11097. [2019-09-08 13:20:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-09-08 13:20:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 18425 transitions. [2019-09-08 13:20:17,142 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 18425 transitions. Word has length 136 [2019-09-08 13:20:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:17,143 INFO L475 AbstractCegarLoop]: Abstraction has 11097 states and 18425 transitions. [2019-09-08 13:20:17,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 18425 transitions. [2019-09-08 13:20:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:20:17,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:17,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:17,149 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1188137794, now seen corresponding path program 1 times [2019-09-08 13:20:17,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:17,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:20:17,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:17,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:17,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:17,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:17,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:17,344 INFO L87 Difference]: Start difference. First operand 11097 states and 18425 transitions. Second operand 3 states. [2019-09-08 13:20:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:17,880 INFO L93 Difference]: Finished difference Result 21684 states and 36050 transitions. [2019-09-08 13:20:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:17,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:20:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:17,925 INFO L225 Difference]: With dead ends: 21684 [2019-09-08 13:20:17,926 INFO L226 Difference]: Without dead ends: 15670 [2019-09-08 13:20:17,944 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 13:20:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2019-09-08 13:20:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15668. [2019-09-08 13:20:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-09-08 13:20:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25956 transitions. [2019-09-08 13:20:18,652 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25956 transitions. Word has length 136 [2019-09-08 13:20:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:18,652 INFO L475 AbstractCegarLoop]: Abstraction has 15668 states and 25956 transitions. [2019-09-08 13:20:18,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25956 transitions. [2019-09-08 13:20:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:20:18,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:18,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:18,655 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1350880053, now seen corresponding path program 1 times [2019-09-08 13:20:18,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:18,799 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 13:20:18,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:18,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:18,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:18,801 INFO L87 Difference]: Start difference. First operand 15668 states and 25956 transitions. Second operand 4 states. [2019-09-08 13:20:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:19,889 INFO L93 Difference]: Finished difference Result 42122 states and 69934 transitions. [2019-09-08 13:20:19,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:19,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 13:20:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:19,964 INFO L225 Difference]: With dead ends: 42122 [2019-09-08 13:20:19,964 INFO L226 Difference]: Without dead ends: 26712 [2019-09-08 13:20:20,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26712 states. [2019-09-08 13:20:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26712 to 23307. [2019-09-08 13:20:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23307 states. [2019-09-08 13:20:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 38542 transitions. [2019-09-08 13:20:21,679 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 38542 transitions. Word has length 136 [2019-09-08 13:20:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:21,679 INFO L475 AbstractCegarLoop]: Abstraction has 23307 states and 38542 transitions. [2019-09-08 13:20:21,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:20:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 38542 transitions. [2019-09-08 13:20:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:20:21,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:21,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:21,683 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:21,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:21,683 INFO L82 PathProgramCache]: Analyzing trace with hash -788578752, now seen corresponding path program 1 times [2019-09-08 13:20:21,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:21,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:21,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:21,783 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 13:20:21,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:21,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:21,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:21,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:21,784 INFO L87 Difference]: Start difference. First operand 23307 states and 38542 transitions. Second operand 3 states. [2019-09-08 13:20:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:23,077 INFO L93 Difference]: Finished difference Result 48435 states and 80219 transitions. [2019-09-08 13:20:23,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:23,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:20:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:23,140 INFO L225 Difference]: With dead ends: 48435 [2019-09-08 13:20:23,140 INFO L226 Difference]: Without dead ends: 33980 [2019-09-08 13:20:23,180 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 13:20:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33980 states. [2019-09-08 13:20:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33980 to 33978. [2019-09-08 13:20:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33978 states. [2019-09-08 13:20:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33978 states to 33978 states and 56027 transitions. [2019-09-08 13:20:24,475 INFO L78 Accepts]: Start accepts. Automaton has 33978 states and 56027 transitions. Word has length 136 [2019-09-08 13:20:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:24,476 INFO L475 AbstractCegarLoop]: Abstraction has 33978 states and 56027 transitions. [2019-09-08 13:20:24,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 33978 states and 56027 transitions. [2019-09-08 13:20:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:20:24,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:24,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:24,479 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:24,479 INFO L82 PathProgramCache]: Analyzing trace with hash -783429068, now seen corresponding path program 1 times [2019-09-08 13:20:24,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:24,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:24,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:24,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:24,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:24,572 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 13:20:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:24,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:24,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:24,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:24,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:24,574 INFO L87 Difference]: Start difference. First operand 33978 states and 56027 transitions. Second operand 3 states. [2019-09-08 13:20:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:26,491 INFO L93 Difference]: Finished difference Result 74043 states and 122228 transitions. [2019-09-08 13:20:26,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:26,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:20:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:26,578 INFO L225 Difference]: With dead ends: 74043 [2019-09-08 13:20:26,578 INFO L226 Difference]: Without dead ends: 50517 [2019-09-08 13:20:26,647 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 13:20:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50517 states. [2019-09-08 13:20:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50517 to 50515. [2019-09-08 13:20:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-08 13:20:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 82987 transitions. [2019-09-08 13:20:28,341 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 82987 transitions. Word has length 136 [2019-09-08 13:20:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:28,341 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 82987 transitions. [2019-09-08 13:20:28,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 82987 transitions. [2019-09-08 13:20:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 13:20:28,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:28,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:28,343 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1129443555, now seen corresponding path program 1 times [2019-09-08 13:20:28,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:28,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:28,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:28,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:28,476 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 13:20:28,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:28,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:20:28,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:20:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:20:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:20:28,478 INFO L87 Difference]: Start difference. First operand 50515 states and 82987 transitions. Second operand 7 states. [2019-09-08 13:20:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:35,347 INFO L93 Difference]: Finished difference Result 235795 states and 387004 transitions. [2019-09-08 13:20:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:20:35,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 13:20:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:35,687 INFO L225 Difference]: With dead ends: 235795 [2019-09-08 13:20:35,688 INFO L226 Difference]: Without dead ends: 185545 [2019-09-08 13:20:35,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:20:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185545 states. [2019-09-08 13:20:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185545 to 140538. [2019-09-08 13:20:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140538 states. [2019-09-08 13:20:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140538 states to 140538 states and 228866 transitions. [2019-09-08 13:20:43,051 INFO L78 Accepts]: Start accepts. Automaton has 140538 states and 228866 transitions. Word has length 137 [2019-09-08 13:20:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:43,051 INFO L475 AbstractCegarLoop]: Abstraction has 140538 states and 228866 transitions. [2019-09-08 13:20:43,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:20:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 140538 states and 228866 transitions. [2019-09-08 13:20:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:20:43,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:43,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:20:43,054 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:43,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash -705506052, now seen corresponding path program 1 times [2019-09-08 13:20:43,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:43,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:43,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:43,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:43,160 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 13:20:43,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:43,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:43,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:43,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:43,162 INFO L87 Difference]: Start difference. First operand 140538 states and 228866 transitions. Second operand 4 states. [2019-09-08 13:20:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:54,236 INFO L93 Difference]: Finished difference Result 414543 states and 675293 transitions. [2019-09-08 13:20:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:54,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 13:20:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:54,666 INFO L225 Difference]: With dead ends: 414543 [2019-09-08 13:20:54,666 INFO L226 Difference]: Without dead ends: 274270 [2019-09-08 13:20:54,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:20:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274270 states. [2019-09-08 13:21:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274270 to 206995. [2019-09-08 13:21:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206995 states. [2019-09-08 13:21:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206995 states to 206995 states and 336271 transitions. [2019-09-08 13:21:06,883 INFO L78 Accepts]: Start accepts. Automaton has 206995 states and 336271 transitions. Word has length 138 [2019-09-08 13:21:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:06,883 INFO L475 AbstractCegarLoop]: Abstraction has 206995 states and 336271 transitions. [2019-09-08 13:21:06,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 206995 states and 336271 transitions. [2019-09-08 13:21:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 13:21:06,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:06,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:06,885 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -876112340, now seen corresponding path program 1 times [2019-09-08 13:21:06,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:07,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:07,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:21:07,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:21:07,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:21:07,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:21:07,224 INFO L87 Difference]: Start difference. First operand 206995 states and 336271 transitions. Second operand 6 states. [2019-09-08 13:21:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:23,409 INFO L93 Difference]: Finished difference Result 505595 states and 822137 transitions. [2019-09-08 13:21:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:21:23,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 13:21:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:23,904 INFO L225 Difference]: With dead ends: 505595 [2019-09-08 13:21:23,904 INFO L226 Difference]: Without dead ends: 298865 [2019-09-08 13:21:24,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:21:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298865 states. [2019-09-08 13:21:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298865 to 236155. [2019-09-08 13:21:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236155 states. [2019-09-08 13:21:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236155 states to 236155 states and 382876 transitions. [2019-09-08 13:21:42,214 INFO L78 Accepts]: Start accepts. Automaton has 236155 states and 382876 transitions. Word has length 140 [2019-09-08 13:21:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:42,214 INFO L475 AbstractCegarLoop]: Abstraction has 236155 states and 382876 transitions. [2019-09-08 13:21:42,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:21:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 236155 states and 382876 transitions. [2019-09-08 13:21:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 13:21:42,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:42,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:42,215 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1795769074, now seen corresponding path program 1 times [2019-09-08 13:21:42,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:42,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:42,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:42,441 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 13:21:42,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:42,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:21:42,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:21:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:21:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:21:42,442 INFO L87 Difference]: Start difference. First operand 236155 states and 382876 transitions. Second operand 6 states. [2019-09-08 13:22:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:07,839 INFO L93 Difference]: Finished difference Result 672497 states and 1092516 transitions. [2019-09-08 13:22:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:22:07,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 13:22:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:08,586 INFO L225 Difference]: With dead ends: 672497 [2019-09-08 13:22:08,586 INFO L226 Difference]: Without dead ends: 436607 [2019-09-08 13:22:08,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:22:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436607 states. [2019-09-08 13:22:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436607 to 420187. [2019-09-08 13:22:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420187 states. [2019-09-08 13:22:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420187 states to 420187 states and 680963 transitions. [2019-09-08 13:22:41,417 INFO L78 Accepts]: Start accepts. Automaton has 420187 states and 680963 transitions. Word has length 143 [2019-09-08 13:22:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:41,418 INFO L475 AbstractCegarLoop]: Abstraction has 420187 states and 680963 transitions. [2019-09-08 13:22:41,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:22:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 420187 states and 680963 transitions. [2019-09-08 13:22:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 13:22:41,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:41,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:41,420 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:41,420 INFO L82 PathProgramCache]: Analyzing trace with hash 163824457, now seen corresponding path program 1 times [2019-09-08 13:22:41,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:41,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:41,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:42,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:42,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:22:42,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:22:42,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:22:42,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:22:42,548 INFO L87 Difference]: Start difference. First operand 420187 states and 680963 transitions. Second operand 5 states. [2019-09-08 13:23:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:25,181 INFO L93 Difference]: Finished difference Result 704203 states and 1136909 transitions. [2019-09-08 13:23:25,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:23:25,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 13:23:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:26,332 INFO L225 Difference]: With dead ends: 704203 [2019-09-08 13:23:26,332 INFO L226 Difference]: Without dead ends: 704201 [2019-09-08 13:23:26,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 13:23:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704201 states. [2019-09-08 13:24:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704201 to 426099. [2019-09-08 13:24:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426099 states. [2019-09-08 13:24:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426099 states to 426099 states and 686830 transitions. [2019-09-08 13:24:08,843 INFO L78 Accepts]: Start accepts. Automaton has 426099 states and 686830 transitions. Word has length 144 [2019-09-08 13:24:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:24:08,843 INFO L475 AbstractCegarLoop]: Abstraction has 426099 states and 686830 transitions. [2019-09-08 13:24:08,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:24:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 426099 states and 686830 transitions. [2019-09-08 13:24:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:24:08,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:24:08,853 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:24:08,853 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:24:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:24:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash 537249617, now seen corresponding path program 1 times [2019-09-08 13:24:08,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:24:08,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:24:08,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:08,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:24:08,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:24:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:24:09,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:24:09,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:24:09,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:24:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:24:09,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:24:09,020 INFO L87 Difference]: Start difference. First operand 426099 states and 686830 transitions. Second operand 3 states. [2019-09-08 13:24:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:24:38,259 INFO L93 Difference]: Finished difference Result 783960 states and 1264481 transitions. [2019-09-08 13:24:38,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:24:38,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 13:24:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:24:38,840 INFO L225 Difference]: With dead ends: 783960 [2019-09-08 13:24:38,840 INFO L226 Difference]: Without dead ends: 358126 [2019-09-08 13:24:39,109 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 13:24:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358126 states. [2019-09-08 13:25:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358126 to 357295. [2019-09-08 13:25:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357295 states. [2019-09-08 13:25:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357295 states to 357295 states and 574614 transitions. [2019-09-08 13:25:09,295 INFO L78 Accepts]: Start accepts. Automaton has 357295 states and 574614 transitions. Word has length 178 [2019-09-08 13:25:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:09,296 INFO L475 AbstractCegarLoop]: Abstraction has 357295 states and 574614 transitions. [2019-09-08 13:25:09,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:25:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 357295 states and 574614 transitions. [2019-09-08 13:25:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:25:09,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:09,302 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:25:09,302 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1114295107, now seen corresponding path program 1 times [2019-09-08 13:25:09,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:09,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:09,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:09,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 13:25:09,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:09,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:25:09,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:25:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:25:09,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:25:09,576 INFO L87 Difference]: Start difference. First operand 357295 states and 574614 transitions. Second operand 4 states. [2019-09-08 13:25:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:58,138 INFO L93 Difference]: Finished difference Result 900329 states and 1446659 transitions. [2019-09-08 13:25:58,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:25:58,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-08 13:25:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:59,342 INFO L225 Difference]: With dead ends: 900329 [2019-09-08 13:25:59,343 INFO L226 Difference]: Without dead ends: 672275 [2019-09-08 13:25:59,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:26:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672275 states. [2019-09-08 13:26:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672275 to 578438. [2019-09-08 13:26:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578438 states. [2019-09-08 13:26:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578438 states to 578438 states and 929380 transitions. [2019-09-08 13:26:50,688 INFO L78 Accepts]: Start accepts. Automaton has 578438 states and 929380 transitions. Word has length 178 [2019-09-08 13:26:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:50,688 INFO L475 AbstractCegarLoop]: Abstraction has 578438 states and 929380 transitions. [2019-09-08 13:26:50,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 578438 states and 929380 transitions. [2019-09-08 13:26:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:26:50,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:50,693 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:26:50,693 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 549360595, now seen corresponding path program 1 times [2019-09-08 13:26:50,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:50,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:50,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:50,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:50,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:50,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:50,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:50,877 INFO L87 Difference]: Start difference. First operand 578438 states and 929380 transitions. Second operand 3 states. [2019-09-08 13:27:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:14,470 INFO L93 Difference]: Finished difference Result 809245 states and 1300662 transitions. [2019-09-08 13:27:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:14,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 13:27:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:14,811 INFO L225 Difference]: With dead ends: 809245 [2019-09-08 13:27:14,811 INFO L226 Difference]: Without dead ends: 231924 [2019-09-08 13:27:15,120 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 13:27:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231924 states. [2019-09-08 13:27:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231924 to 231922. [2019-09-08 13:27:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231922 states. [2019-09-08 13:27:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231922 states to 231922 states and 371646 transitions. [2019-09-08 13:27:36,714 INFO L78 Accepts]: Start accepts. Automaton has 231922 states and 371646 transitions. Word has length 179 [2019-09-08 13:27:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:36,715 INFO L475 AbstractCegarLoop]: Abstraction has 231922 states and 371646 transitions. [2019-09-08 13:27:36,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 231922 states and 371646 transitions. [2019-09-08 13:27:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:27:36,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:36,718 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:27:36,719 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1888394913, now seen corresponding path program 1 times [2019-09-08 13:27:36,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:36,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:36,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:27:36,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:36,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:27:36,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:27:36,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:27:36,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:27:36,886 INFO L87 Difference]: Start difference. First operand 231922 states and 371646 transitions. Second operand 6 states. [2019-09-08 13:28:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:02,009 INFO L93 Difference]: Finished difference Result 422762 states and 679474 transitions. [2019-09-08 13:28:02,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:28:02,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-08 13:28:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:02,469 INFO L225 Difference]: With dead ends: 422762 [2019-09-08 13:28:02,470 INFO L226 Difference]: Without dead ends: 299159 [2019-09-08 13:28:02,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:28:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299159 states. [2019-09-08 13:28:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299159 to 270089. [2019-09-08 13:28:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270089 states. [2019-09-08 13:28:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270089 states to 270089 states and 432662 transitions. [2019-09-08 13:28:21,239 INFO L78 Accepts]: Start accepts. Automaton has 270089 states and 432662 transitions. Word has length 179 [2019-09-08 13:28:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:21,239 INFO L475 AbstractCegarLoop]: Abstraction has 270089 states and 432662 transitions. [2019-09-08 13:28:21,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:28:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 270089 states and 432662 transitions. [2019-09-08 13:28:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:28:21,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:21,242 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:21,242 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1810248098, now seen corresponding path program 1 times [2019-09-08 13:28:21,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:21,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:21,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:21,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:21,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:21,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:21,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:21,369 INFO L87 Difference]: Start difference. First operand 270089 states and 432662 transitions. Second operand 3 states. [2019-09-08 13:28:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:34,885 INFO L93 Difference]: Finished difference Result 376184 states and 603017 transitions. [2019-09-08 13:28:34,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:34,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 13:28:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:35,030 INFO L225 Difference]: With dead ends: 376184 [2019-09-08 13:28:35,030 INFO L226 Difference]: Without dead ends: 106956 [2019-09-08 13:28:35,188 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 13:28:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106956 states. [2019-09-08 13:28:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106956 to 106954. [2019-09-08 13:28:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106954 states. [2019-09-08 13:28:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106954 states to 106954 states and 171064 transitions. [2019-09-08 13:28:41,574 INFO L78 Accepts]: Start accepts. Automaton has 106954 states and 171064 transitions. Word has length 180 [2019-09-08 13:28:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:41,574 INFO L475 AbstractCegarLoop]: Abstraction has 106954 states and 171064 transitions. [2019-09-08 13:28:41,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 106954 states and 171064 transitions. [2019-09-08 13:28:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:28:41,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:41,578 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:41,578 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1340905464, now seen corresponding path program 1 times [2019-09-08 13:28:41,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:41,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:41,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:41,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:41,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:41,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:41,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:41,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:41,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:41,702 INFO L87 Difference]: Start difference. First operand 106954 states and 171064 transitions. Second operand 3 states. [2019-09-08 13:28:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:44,925 INFO L93 Difference]: Finished difference Result 149109 states and 238849 transitions. [2019-09-08 13:28:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:44,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 13:28:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:44,975 INFO L225 Difference]: With dead ends: 149109 [2019-09-08 13:28:44,975 INFO L226 Difference]: Without dead ends: 42850 [2019-09-08 13:28:45,042 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 13:28:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42850 states. [2019-09-08 13:28:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42850 to 42848. [2019-09-08 13:28:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42848 states. [2019-09-08 13:28:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42848 states to 42848 states and 68620 transitions. [2019-09-08 13:28:47,843 INFO L78 Accepts]: Start accepts. Automaton has 42848 states and 68620 transitions. Word has length 180 [2019-09-08 13:28:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:47,843 INFO L475 AbstractCegarLoop]: Abstraction has 42848 states and 68620 transitions. [2019-09-08 13:28:47,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 42848 states and 68620 transitions. [2019-09-08 13:28:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:28:47,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:47,845 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:47,845 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash -15485732, now seen corresponding path program 1 times [2019-09-08 13:28:47,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:47,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:47,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:47,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:28:48,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:48,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:28:48,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:28:48,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:28:48,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:28:48,033 INFO L87 Difference]: Start difference. First operand 42848 states and 68620 transitions. Second operand 6 states. [2019-09-08 13:28:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:52,061 INFO L93 Difference]: Finished difference Result 71803 states and 115368 transitions. [2019-09-08 13:28:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:28:52,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-09-08 13:28:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:52,137 INFO L225 Difference]: With dead ends: 71803 [2019-09-08 13:28:52,137 INFO L226 Difference]: Without dead ends: 60720 [2019-09-08 13:28:52,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 13:28:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60720 states. [2019-09-08 13:28:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60720 to 48294. [2019-09-08 13:28:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48294 states. [2019-09-08 13:28:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48294 states to 48294 states and 77353 transitions. [2019-09-08 13:28:55,824 INFO L78 Accepts]: Start accepts. Automaton has 48294 states and 77353 transitions. Word has length 181 [2019-09-08 13:28:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:55,824 INFO L475 AbstractCegarLoop]: Abstraction has 48294 states and 77353 transitions. [2019-09-08 13:28:55,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:28:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 48294 states and 77353 transitions. [2019-09-08 13:28:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 13:28:55,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:55,826 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:55,826 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:55,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1589177119, now seen corresponding path program 1 times [2019-09-08 13:28:55,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:55,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:55,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:55,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:55,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:55,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:28:55,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 13:28:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:28:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:56,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:28:56,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:28:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:28:56,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:28:56,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:28:56,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:28:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:28:56,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:28:56,481 INFO L87 Difference]: Start difference. First operand 48294 states and 77353 transitions. Second operand 9 states. [2019-09-08 13:29:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:04,741 INFO L93 Difference]: Finished difference Result 116425 states and 187248 transitions. [2019-09-08 13:29:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:29:04,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-09-08 13:29:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:05,176 INFO L225 Difference]: With dead ends: 116425 [2019-09-08 13:29:05,176 INFO L226 Difference]: Without dead ends: 105342 [2019-09-08 13:29:05,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:29:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105342 states. [2019-09-08 13:29:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105342 to 81908. [2019-09-08 13:29:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81908 states. [2019-09-08 13:29:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81908 states to 81908 states and 131340 transitions. [2019-09-08 13:29:13,400 INFO L78 Accepts]: Start accepts. Automaton has 81908 states and 131340 transitions. Word has length 181 [2019-09-08 13:29:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:13,400 INFO L475 AbstractCegarLoop]: Abstraction has 81908 states and 131340 transitions. [2019-09-08 13:29:13,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:29:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 81908 states and 131340 transitions. [2019-09-08 13:29:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:29:13,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:13,405 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:29:13,405 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:13,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:13,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2017038376, now seen corresponding path program 1 times [2019-09-08 13:29:13,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:13,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:13,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:13,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:13,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:29:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:13,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:13,749 INFO L87 Difference]: Start difference. First operand 81908 states and 131340 transitions. Second operand 4 states. [2019-09-08 13:29:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:22,828 INFO L93 Difference]: Finished difference Result 156522 states and 250604 transitions. [2019-09-08 13:29:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:22,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-08 13:29:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:23,037 INFO L225 Difference]: With dead ends: 156522 [2019-09-08 13:29:23,038 INFO L226 Difference]: Without dead ends: 113698 [2019-09-08 13:29:23,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113698 states. [2019-09-08 13:29:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113698 to 81646. [2019-09-08 13:29:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81646 states. [2019-09-08 13:29:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81646 states to 81646 states and 130922 transitions. [2019-09-08 13:29:30,336 INFO L78 Accepts]: Start accepts. Automaton has 81646 states and 130922 transitions. Word has length 182 [2019-09-08 13:29:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:30,336 INFO L475 AbstractCegarLoop]: Abstraction has 81646 states and 130922 transitions. [2019-09-08 13:29:30,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:29:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 81646 states and 130922 transitions. [2019-09-08 13:29:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:29:30,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:30,338 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:30,338 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -546225976, now seen corresponding path program 1 times [2019-09-08 13:29:30,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:30,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:30,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:30,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:30,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:29:30,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 13:29:30,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:29:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:30,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 13:29:30,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:29:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:29:30,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:29:30,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 13:29:30,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 13:29:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 13:29:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:29:30,946 INFO L87 Difference]: Start difference. First operand 81646 states and 130922 transitions. Second operand 11 states. [2019-09-08 13:29:35,415 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-08 13:30:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:17,528 INFO L93 Difference]: Finished difference Result 557238 states and 897834 transitions. [2019-09-08 13:30:17,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-08 13:30:17,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 182 [2019-09-08 13:30:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:18,736 INFO L225 Difference]: With dead ends: 557238 [2019-09-08 13:30:18,736 INFO L226 Difference]: Without dead ends: 510722 [2019-09-08 13:30:18,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=754, Invalid=3152, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 13:30:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510722 states. [2019-09-08 13:31:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510722 to 444020. [2019-09-08 13:31:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444020 states. [2019-09-08 13:31:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444020 states to 444020 states and 711152 transitions. [2019-09-08 13:31:06,095 INFO L78 Accepts]: Start accepts. Automaton has 444020 states and 711152 transitions. Word has length 182 [2019-09-08 13:31:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:06,095 INFO L475 AbstractCegarLoop]: Abstraction has 444020 states and 711152 transitions. [2019-09-08 13:31:06,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 13:31:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 444020 states and 711152 transitions. [2019-09-08 13:31:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 13:31:06,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:06,097 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:31:06,097 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:06,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:06,097 INFO L82 PathProgramCache]: Analyzing trace with hash 643340613, now seen corresponding path program 1 times [2019-09-08 13:31:06,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:06,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:06,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:06,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:31:06,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:06,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:31:06,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:31:06,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:31:06,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:31:06,535 INFO L87 Difference]: Start difference. First operand 444020 states and 711152 transitions. Second operand 6 states.