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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:15:08,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:15:08,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:15:08,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:15:08,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:15:08,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:15:08,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:15:08,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:15:08,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:15:08,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:15:08,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:15:08,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:15:08,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:15:08,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:15:08,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:15:08,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:15:08,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:15:08,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:15:08,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:15:08,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:15:08,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:15:08,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:15:08,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:15:08,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:15:08,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:15:08,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:15:08,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:15:08,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:15:08,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:15:08,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:15:08,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:15:08,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:15:08,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:15:08,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:15:08,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:15:08,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:15:08,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:15:08,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:15:08,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:15:08,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:15:08,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:15:08,803 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:15:08,826 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:15:08,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:15:08,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:15:08,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:15:08,829 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:15:08,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:15:08,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:15:08,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:15:08,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:15:08,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:15:08,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:15:08,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:15:08,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:15:08,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:15:08,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:15:08,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:15:08,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:15:08,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:15:08,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:15:08,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:15:08,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:15:08,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:15:08,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:15:08,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:15:08,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:15:08,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:15:08,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:15:08,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:15:08,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:15:08,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:15:08,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:15:08,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:15:08,893 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:15:08,893 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:15:08,894 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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:15:08,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92530a64e/a40b23ebb9894b679b201e1b8fe712db/FLAG44c0e1df6 [2019-09-08 13:15:09,537 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:15:09,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:15:09,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92530a64e/a40b23ebb9894b679b201e1b8fe712db/FLAG44c0e1df6 [2019-09-08 13:15:09,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92530a64e/a40b23ebb9894b679b201e1b8fe712db [2019-09-08 13:15:09,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:15:09,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:15:09,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:15:09,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:15:09,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:15:09,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:15:09" (1/1) ... [2019-09-08 13:15:09,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4741b8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:09, skipping insertion in model container [2019-09-08 13:15:09,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:15:09" (1/1) ... [2019-09-08 13:15:09,813 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:15:09,886 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:15:10,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:15:10,613 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:15:10,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:15:10,800 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:15:10,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10 WrapperNode [2019-09-08 13:15:10,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:15:10,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:15:10,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:15:10,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:15:10,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (1/1) ... [2019-09-08 13:15:10,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (1/1) ... [2019-09-08 13:15:10,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (1/1) ... [2019-09-08 13:15:10,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (1/1) ... [2019-09-08 13:15:10,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (1/1) ... [2019-09-08 13:15:10,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (1/1) ... [2019-09-08 13:15:10,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (1/1) ... [2019-09-08 13:15:10,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:15:10,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:15:10,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:15:10,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:15:10,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (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:15:10,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:15:10,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:15:10,964 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:15:10,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:15:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:15:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:15:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:15:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:15:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:15:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:15:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:15:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:15:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:15:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:15:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:15:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:15:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:15:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:15:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:15:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:15:12,613 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:15:12,614 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:15:12,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:15:12 BoogieIcfgContainer [2019-09-08 13:15:12,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:15:12,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:15:12,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:15:12,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:15:12,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:15:09" (1/3) ... [2019-09-08 13:15:12,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c80dc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:15:12, skipping insertion in model container [2019-09-08 13:15:12,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:15:10" (2/3) ... [2019-09-08 13:15:12,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c80dc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:15:12, skipping insertion in model container [2019-09-08 13:15:12,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:15:12" (3/3) ... [2019-09-08 13:15:12,629 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 13:15:12,641 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:15:12,668 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:15:12,684 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:15:12,722 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:15:12,723 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:15:12,723 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:15:12,723 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:15:12,723 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:15:12,724 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:15:12,724 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:15:12,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:15:12,724 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:15:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states. [2019-09-08 13:15:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:15:12,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:12,774 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:15:12,776 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash -173501281, now seen corresponding path program 1 times [2019-09-08 13:15:12,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:12,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:12,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:13,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:13,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:13,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:13,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:13,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:13,495 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 3 states. [2019-09-08 13:15:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:13,667 INFO L93 Difference]: Finished difference Result 659 states and 1131 transitions. [2019-09-08 13:15:13,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:13,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 13:15:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:13,690 INFO L225 Difference]: With dead ends: 659 [2019-09-08 13:15:13,690 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 13:15:13,695 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:15:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 13:15:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2019-09-08 13:15:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-08 13:15:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 805 transitions. [2019-09-08 13:15:13,846 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 805 transitions. Word has length 122 [2019-09-08 13:15:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:13,847 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 805 transitions. [2019-09-08 13:15:13,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 805 transitions. [2019-09-08 13:15:13,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:15:13,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:13,859 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:15:13,860 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:13,862 INFO L82 PathProgramCache]: Analyzing trace with hash -911022634, now seen corresponding path program 1 times [2019-09-08 13:15:13,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:13,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:13,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:14,107 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:15:14,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:14,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:14,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:14,111 INFO L87 Difference]: Start difference. First operand 490 states and 805 transitions. Second operand 3 states. [2019-09-08 13:15:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:14,180 INFO L93 Difference]: Finished difference Result 1056 states and 1745 transitions. [2019-09-08 13:15:14,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:14,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:15:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:14,186 INFO L225 Difference]: With dead ends: 1056 [2019-09-08 13:15:14,186 INFO L226 Difference]: Without dead ends: 763 [2019-09-08 13:15:14,189 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:15:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-09-08 13:15:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2019-09-08 13:15:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-08 13:15:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1250 transitions. [2019-09-08 13:15:14,230 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1250 transitions. Word has length 125 [2019-09-08 13:15:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:14,231 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1250 transitions. [2019-09-08 13:15:14,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1250 transitions. [2019-09-08 13:15:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:15:14,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:14,234 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:15:14,234 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash -462854808, now seen corresponding path program 1 times [2019-09-08 13:15:14,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:14,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:14,416 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:15:14,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:14,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:14,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:14,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:14,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:14,420 INFO L87 Difference]: Start difference. First operand 759 states and 1250 transitions. Second operand 3 states. [2019-09-08 13:15:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:14,489 INFO L93 Difference]: Finished difference Result 1843 states and 3044 transitions. [2019-09-08 13:15:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:14,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 13:15:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:14,498 INFO L225 Difference]: With dead ends: 1843 [2019-09-08 13:15:14,498 INFO L226 Difference]: Without dead ends: 1281 [2019-09-08 13:15:14,501 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:15:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-08 13:15:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1275. [2019-09-08 13:15:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-09-08 13:15:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2098 transitions. [2019-09-08 13:15:14,593 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2098 transitions. Word has length 128 [2019-09-08 13:15:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:14,594 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 2098 transitions. [2019-09-08 13:15:14,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2098 transitions. [2019-09-08 13:15:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:15:14,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:14,597 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:15:14,597 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 750481413, now seen corresponding path program 1 times [2019-09-08 13:15:14,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:14,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:14,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:14,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:14,736 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:15:14,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:14,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:14,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:14,738 INFO L87 Difference]: Start difference. First operand 1275 states and 2098 transitions. Second operand 3 states. [2019-09-08 13:15:14,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:14,846 INFO L93 Difference]: Finished difference Result 3351 states and 5516 transitions. [2019-09-08 13:15:14,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:14,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 13:15:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:14,861 INFO L225 Difference]: With dead ends: 3351 [2019-09-08 13:15:14,862 INFO L226 Difference]: Without dead ends: 2273 [2019-09-08 13:15:14,866 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:15:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-09-08 13:15:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2263. [2019-09-08 13:15:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2019-09-08 13:15:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3710 transitions. [2019-09-08 13:15:14,996 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3710 transitions. Word has length 131 [2019-09-08 13:15:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:14,998 INFO L475 AbstractCegarLoop]: Abstraction has 2263 states and 3710 transitions. [2019-09-08 13:15:14,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3710 transitions. [2019-09-08 13:15:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 13:15:15,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:15,001 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:15:15,001 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2145185539, now seen corresponding path program 1 times [2019-09-08 13:15:15,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:15,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:15,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:15,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:15,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:15,275 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:15:15,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:15,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:15:15,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:15:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:15:15,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:15:15,278 INFO L87 Difference]: Start difference. First operand 2263 states and 3710 transitions. Second operand 6 states. [2019-09-08 13:15:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:16,077 INFO L93 Difference]: Finished difference Result 8633 states and 14239 transitions. [2019-09-08 13:15:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:15:16,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 13:15:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:16,129 INFO L225 Difference]: With dead ends: 8633 [2019-09-08 13:15:16,130 INFO L226 Difference]: Without dead ends: 6567 [2019-09-08 13:15:16,140 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:15:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6567 states. [2019-09-08 13:15:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6567 to 5164. [2019-09-08 13:15:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-09-08 13:15:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8485 transitions. [2019-09-08 13:15:16,633 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8485 transitions. Word has length 134 [2019-09-08 13:15:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:16,634 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8485 transitions. [2019-09-08 13:15:16,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:15:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8485 transitions. [2019-09-08 13:15:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 13:15:16,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:16,639 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:15:16,639 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2142410535, now seen corresponding path program 1 times [2019-09-08 13:15:16,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:16,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:16,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:16,836 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:15:16,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:16,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:16,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:16,838 INFO L87 Difference]: Start difference. First operand 5164 states and 8485 transitions. Second operand 4 states. [2019-09-08 13:15:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:17,428 INFO L93 Difference]: Finished difference Result 13702 states and 22612 transitions. [2019-09-08 13:15:17,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:17,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 13:15:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:17,481 INFO L225 Difference]: With dead ends: 13702 [2019-09-08 13:15:17,482 INFO L226 Difference]: Without dead ends: 8735 [2019-09-08 13:15:17,496 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:15:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-09-08 13:15:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7629. [2019-09-08 13:15:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7629 states. [2019-09-08 13:15:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 12558 transitions. [2019-09-08 13:15:18,031 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 12558 transitions. Word has length 135 [2019-09-08 13:15:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:18,033 INFO L475 AbstractCegarLoop]: Abstraction has 7629 states and 12558 transitions. [2019-09-08 13:15:18,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 12558 transitions. [2019-09-08 13:15:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:15:18,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:18,039 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:15:18,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2051827388, now seen corresponding path program 1 times [2019-09-08 13:15:18,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:18,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:18,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:18,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:18,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:18,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:18,238 INFO L87 Difference]: Start difference. First operand 7629 states and 12558 transitions. Second operand 4 states. [2019-09-08 13:15:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:18,930 INFO L93 Difference]: Finished difference Result 20302 states and 33486 transitions. [2019-09-08 13:15:18,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:18,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 13:15:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:18,982 INFO L225 Difference]: With dead ends: 20302 [2019-09-08 13:15:18,982 INFO L226 Difference]: Without dead ends: 12870 [2019-09-08 13:15:19,002 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:15:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12870 states. [2019-09-08 13:15:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12870 to 11204. [2019-09-08 13:15:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11204 states. [2019-09-08 13:15:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11204 states to 11204 states and 18427 transitions. [2019-09-08 13:15:19,643 INFO L78 Accepts]: Start accepts. Automaton has 11204 states and 18427 transitions. Word has length 136 [2019-09-08 13:15:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:19,644 INFO L475 AbstractCegarLoop]: Abstraction has 11204 states and 18427 transitions. [2019-09-08 13:15:19,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11204 states and 18427 transitions. [2019-09-08 13:15:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 13:15:19,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:19,651 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:15:19,651 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash 760808192, now seen corresponding path program 1 times [2019-09-08 13:15:19,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:19,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:19,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:19,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:19,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:15:19,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:15:19,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:15:19,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:15:19,822 INFO L87 Difference]: Start difference. First operand 11204 states and 18427 transitions. Second operand 7 states. [2019-09-08 13:15:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:23,008 INFO L93 Difference]: Finished difference Result 52340 states and 86153 transitions. [2019-09-08 13:15:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:15:23,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 13:15:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:23,131 INFO L225 Difference]: With dead ends: 52340 [2019-09-08 13:15:23,131 INFO L226 Difference]: Without dead ends: 41333 [2019-09-08 13:15:23,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:15:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-09-08 13:15:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 32212. [2019-09-08 13:15:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32212 states. [2019-09-08 13:15:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32212 states to 32212 states and 52804 transitions. [2019-09-08 13:15:25,061 INFO L78 Accepts]: Start accepts. Automaton has 32212 states and 52804 transitions. Word has length 137 [2019-09-08 13:15:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:25,063 INFO L475 AbstractCegarLoop]: Abstraction has 32212 states and 52804 transitions. [2019-09-08 13:15:25,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:15:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32212 states and 52804 transitions. [2019-09-08 13:15:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:15:25,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:25,070 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:15:25,070 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash 547273736, now seen corresponding path program 1 times [2019-09-08 13:15:25,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:25,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:25,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:25,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:25,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:25,176 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:15:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:25,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:25,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:25,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:25,178 INFO L87 Difference]: Start difference. First operand 32212 states and 52804 transitions. Second operand 3 states. [2019-09-08 13:15:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:28,105 INFO L93 Difference]: Finished difference Result 68578 states and 112387 transitions. [2019-09-08 13:15:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:28,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:15:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:28,261 INFO L225 Difference]: With dead ends: 68578 [2019-09-08 13:15:28,261 INFO L226 Difference]: Without dead ends: 47784 [2019-09-08 13:15:28,308 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:15:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47784 states. [2019-09-08 13:15:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47784 to 47782. [2019-09-08 13:15:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2019-09-08 13:15:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 78034 transitions. [2019-09-08 13:15:30,300 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 78034 transitions. Word has length 138 [2019-09-08 13:15:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:30,300 INFO L475 AbstractCegarLoop]: Abstraction has 47782 states and 78034 transitions. [2019-09-08 13:15:30,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 78034 transitions. [2019-09-08 13:15:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:15:30,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:30,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:30,305 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:30,306 INFO L82 PathProgramCache]: Analyzing trace with hash 696050988, now seen corresponding path program 1 times [2019-09-08 13:15:30,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:30,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:30,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:30,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:30,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:30,415 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:15:30,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:30,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:30,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:30,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:30,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:30,416 INFO L87 Difference]: Start difference. First operand 47782 states and 78034 transitions. Second operand 3 states. [2019-09-08 13:15:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:33,802 INFO L93 Difference]: Finished difference Result 98341 states and 160808 transitions. [2019-09-08 13:15:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:33,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:15:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:33,979 INFO L225 Difference]: With dead ends: 98341 [2019-09-08 13:15:33,979 INFO L226 Difference]: Without dead ends: 68203 [2019-09-08 13:15:34,026 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:15:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-09-08 13:15:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 68201. [2019-09-08 13:15:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68201 states. [2019-09-08 13:15:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68201 states to 68201 states and 111031 transitions. [2019-09-08 13:15:36,563 INFO L78 Accepts]: Start accepts. Automaton has 68201 states and 111031 transitions. Word has length 138 [2019-09-08 13:15:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:36,564 INFO L475 AbstractCegarLoop]: Abstraction has 68201 states and 111031 transitions. [2019-09-08 13:15:36,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 68201 states and 111031 transitions. [2019-09-08 13:15:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:15:36,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:36,567 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:15:36,567 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2057723275, now seen corresponding path program 1 times [2019-09-08 13:15:36,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:36,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:36,669 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:15:36,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:36,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:36,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:36,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:36,670 INFO L87 Difference]: Start difference. First operand 68201 states and 111031 transitions. Second operand 4 states. [2019-09-08 13:15:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:42,064 INFO L93 Difference]: Finished difference Result 199194 states and 324565 transitions. [2019-09-08 13:15:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:42,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 13:15:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:42,318 INFO L225 Difference]: With dead ends: 199194 [2019-09-08 13:15:42,319 INFO L226 Difference]: Without dead ends: 133397 [2019-09-08 13:15:42,426 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:15:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133397 states. [2019-09-08 13:15:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133397 to 100647. [2019-09-08 13:15:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100647 states. [2019-09-08 13:15:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100647 states to 100647 states and 163638 transitions. [2019-09-08 13:15:49,272 INFO L78 Accepts]: Start accepts. Automaton has 100647 states and 163638 transitions. Word has length 138 [2019-09-08 13:15:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:49,272 INFO L475 AbstractCegarLoop]: Abstraction has 100647 states and 163638 transitions. [2019-09-08 13:15:49,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 100647 states and 163638 transitions. [2019-09-08 13:15:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:15:49,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:49,275 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:15:49,275 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1977095112, now seen corresponding path program 1 times [2019-09-08 13:15:49,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:49,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:49,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:49,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:49,373 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:15:49,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:49,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:49,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:49,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:49,375 INFO L87 Difference]: Start difference. First operand 100647 states and 163638 transitions. Second operand 3 states. [2019-09-08 13:15:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:55,766 INFO L93 Difference]: Finished difference Result 218957 states and 356288 transitions. [2019-09-08 13:15:55,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:55,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:15:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:56,015 INFO L225 Difference]: With dead ends: 218957 [2019-09-08 13:15:56,016 INFO L226 Difference]: Without dead ends: 148819 [2019-09-08 13:15:56,098 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:15:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148819 states. [2019-09-08 13:16:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148819 to 148817. [2019-09-08 13:16:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148817 states. [2019-09-08 13:16:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148817 states to 148817 states and 240983 transitions. [2019-09-08 13:16:04,423 INFO L78 Accepts]: Start accepts. Automaton has 148817 states and 240983 transitions. Word has length 138 [2019-09-08 13:16:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:04,424 INFO L475 AbstractCegarLoop]: Abstraction has 148817 states and 240983 transitions. [2019-09-08 13:16:04,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 148817 states and 240983 transitions. [2019-09-08 13:16:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:16:04,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:04,426 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:16:04,426 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:04,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:04,426 INFO L82 PathProgramCache]: Analyzing trace with hash -682116612, now seen corresponding path program 1 times [2019-09-08 13:16:04,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:04,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:04,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:04,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:04,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:04,522 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:16:04,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:04,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:16:04,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:16:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:16:04,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:04,524 INFO L87 Difference]: Start difference. First operand 148817 states and 240983 transitions. Second operand 3 states. [2019-09-08 13:16:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:14,769 INFO L93 Difference]: Finished difference Result 321956 states and 523325 transitions. [2019-09-08 13:16:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:16:14,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 13:16:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:15,130 INFO L225 Difference]: With dead ends: 321956 [2019-09-08 13:16:15,130 INFO L226 Difference]: Without dead ends: 216937 [2019-09-08 13:16:15,233 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:16:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216937 states. [2019-09-08 13:16:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216937 to 216935. [2019-09-08 13:16:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216935 states. [2019-09-08 13:16:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216935 states to 216935 states and 350275 transitions. [2019-09-08 13:16:27,756 INFO L78 Accepts]: Start accepts. Automaton has 216935 states and 350275 transitions. Word has length 138 [2019-09-08 13:16:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:27,756 INFO L475 AbstractCegarLoop]: Abstraction has 216935 states and 350275 transitions. [2019-09-08 13:16:27,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 216935 states and 350275 transitions. [2019-09-08 13:16:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 13:16:27,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:27,757 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:16:27,758 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash 297482555, now seen corresponding path program 1 times [2019-09-08 13:16:27,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:27,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:27,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:28,081 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:16:28,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:28,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:16:28,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:16:28,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:16:28,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:16:28,083 INFO L87 Difference]: Start difference. First operand 216935 states and 350275 transitions. Second operand 6 states. [2019-09-08 13:16:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:46,847 INFO L93 Difference]: Finished difference Result 529867 states and 856378 transitions. [2019-09-08 13:16:46,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:16:46,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 13:16:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:47,396 INFO L225 Difference]: With dead ends: 529867 [2019-09-08 13:16:47,396 INFO L226 Difference]: Without dead ends: 313197 [2019-09-08 13:16:47,584 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:16:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313197 states. [2019-09-08 13:17:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313197 to 247495. [2019-09-08 13:17:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247495 states. [2019-09-08 13:17:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247495 states to 247495 states and 398885 transitions. [2019-09-08 13:17:02,496 INFO L78 Accepts]: Start accepts. Automaton has 247495 states and 398885 transitions. Word has length 140 [2019-09-08 13:17:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:02,496 INFO L475 AbstractCegarLoop]: Abstraction has 247495 states and 398885 transitions. [2019-09-08 13:17:02,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:17:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 247495 states and 398885 transitions. [2019-09-08 13:17:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 13:17:02,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:02,497 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:17:02,497 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash -264023695, now seen corresponding path program 1 times [2019-09-08 13:17:02,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:02,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:02,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:02,742 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:17:02,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:02,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:17:02,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:17:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:17:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:17:02,744 INFO L87 Difference]: Start difference. First operand 247495 states and 398885 transitions. Second operand 6 states. [2019-09-08 13:17:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:29,319 INFO L93 Difference]: Finished difference Result 704873 states and 1138264 transitions. [2019-09-08 13:17:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:17:29,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 13:17:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:30,133 INFO L225 Difference]: With dead ends: 704873 [2019-09-08 13:17:30,133 INFO L226 Difference]: Without dead ends: 457643 [2019-09-08 13:17:30,371 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:17:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457643 states. [2019-09-08 13:18:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457643 to 440423. [2019-09-08 13:18:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440423 states. [2019-09-08 13:18:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440423 states to 440423 states and 709542 transitions. [2019-09-08 13:18:07,138 INFO L78 Accepts]: Start accepts. Automaton has 440423 states and 709542 transitions. Word has length 143 [2019-09-08 13:18:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:07,138 INFO L475 AbstractCegarLoop]: Abstraction has 440423 states and 709542 transitions. [2019-09-08 13:18:07,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:18:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 440423 states and 709542 transitions. [2019-09-08 13:18:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 13:18:07,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:07,139 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:07,140 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:07,140 INFO L82 PathProgramCache]: Analyzing trace with hash 403290968, now seen corresponding path program 1 times [2019-09-08 13:18:07,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:07,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:18:07,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:07,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:18:07,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:18:07,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:18:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:18:07,319 INFO L87 Difference]: Start difference. First operand 440423 states and 709542 transitions. Second operand 5 states. [2019-09-08 13:18:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:54,235 INFO L93 Difference]: Finished difference Result 737113 states and 1183399 transitions. [2019-09-08 13:18:54,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:18:54,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 13:18:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:55,658 INFO L225 Difference]: With dead ends: 737113 [2019-09-08 13:18:55,658 INFO L226 Difference]: Without dead ends: 737111 [2019-09-08 13:18:55,829 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:18:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737111 states. [2019-09-08 13:19:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737111 to 446335. [2019-09-08 13:19:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446335 states. [2019-09-08 13:19:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446335 states to 446335 states and 715409 transitions. [2019-09-08 13:19:43,926 INFO L78 Accepts]: Start accepts. Automaton has 446335 states and 715409 transitions. Word has length 144 [2019-09-08 13:19:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:43,927 INFO L475 AbstractCegarLoop]: Abstraction has 446335 states and 715409 transitions. [2019-09-08 13:19:43,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:19:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 446335 states and 715409 transitions. [2019-09-08 13:19:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:19:43,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:43,931 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, 1, 1] [2019-09-08 13:19:43,931 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:43,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1108095999, now seen corresponding path program 1 times [2019-09-08 13:19:43,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:43,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:43,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:19:44,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:44,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:19:44,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:19:44,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:19:44,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:19:44,122 INFO L87 Difference]: Start difference. First operand 446335 states and 715409 transitions. Second operand 6 states. [2019-09-08 13:20:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:26,244 INFO L93 Difference]: Finished difference Result 766026 states and 1232016 transitions. [2019-09-08 13:20:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:20:26,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:20:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:27,280 INFO L225 Difference]: With dead ends: 766026 [2019-09-08 13:20:27,280 INFO L226 Difference]: Without dead ends: 540412 [2019-09-08 13:20:27,545 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:20:28,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540412 states. [2019-09-08 13:21:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540412 to 498602. [2019-09-08 13:21:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498602 states. [2019-09-08 13:21:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498602 states to 498602 states and 799201 transitions. [2019-09-08 13:21:10,517 INFO L78 Accepts]: Start accepts. Automaton has 498602 states and 799201 transitions. Word has length 180 [2019-09-08 13:21:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:10,517 INFO L475 AbstractCegarLoop]: Abstraction has 498602 states and 799201 transitions. [2019-09-08 13:21:10,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:21:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 498602 states and 799201 transitions. [2019-09-08 13:21:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:21:10,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:10,522 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, 1, 1] [2019-09-08 13:21:10,522 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash -959318747, now seen corresponding path program 1 times [2019-09-08 13:21:10,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:10,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:10,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:10,728 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:21:10,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:10,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:21:10,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:21:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:21:10,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:21:10,730 INFO L87 Difference]: Start difference. First operand 498602 states and 799201 transitions. Second operand 6 states. [2019-09-08 13:22:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:02,010 INFO L93 Difference]: Finished difference Result 850610 states and 1368862 transitions. [2019-09-08 13:22:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:22:02,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 13:22:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:03,780 INFO L225 Difference]: With dead ends: 850610 [2019-09-08 13:22:03,780 INFO L226 Difference]: Without dead ends: 651224 [2019-09-08 13:22:04,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:22:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651224 states. [2019-09-08 13:22:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651224 to 489736. [2019-09-08 13:22:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489736 states. [2019-09-08 13:22:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489736 states to 489736 states and 784841 transitions. [2019-09-08 13:22:50,530 INFO L78 Accepts]: Start accepts. Automaton has 489736 states and 784841 transitions. Word has length 180 [2019-09-08 13:22:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:50,530 INFO L475 AbstractCegarLoop]: Abstraction has 489736 states and 784841 transitions. [2019-09-08 13:22:50,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:22:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 489736 states and 784841 transitions. [2019-09-08 13:22:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:22:50,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:50,534 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, 1, 1] [2019-09-08 13:22:50,535 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:50,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 662502449, now seen corresponding path program 1 times [2019-09-08 13:22:50,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:50,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:50,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:22:50,698 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:22:50,718 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:22:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:50,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 13:22:50,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:22:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 13:22:51,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:22:51,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 13:22:51,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:22:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:22:51,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:22:51,098 INFO L87 Difference]: Start difference. First operand 489736 states and 784841 transitions. Second operand 9 states. [2019-09-08 13:24:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:24:08,982 INFO L93 Difference]: Finished difference Result 1104125 states and 1779620 transitions. [2019-09-08 13:24:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:24:08,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-09-08 13:24:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:24:11,736 INFO L225 Difference]: With dead ends: 1104125 [2019-09-08 13:24:11,736 INFO L226 Difference]: Without dead ends: 979331 [2019-09-08 13:24:11,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:24:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979331 states. [2019-09-08 13:25:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979331 to 807771. [2019-09-08 13:25:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807771 states. [2019-09-08 13:25:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807771 states to 807771 states and 1297417 transitions. [2019-09-08 13:25:39,753 INFO L78 Accepts]: Start accepts. Automaton has 807771 states and 1297417 transitions. Word has length 180 [2019-09-08 13:25:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:39,754 INFO L475 AbstractCegarLoop]: Abstraction has 807771 states and 1297417 transitions. [2019-09-08 13:25:39,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:25:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 807771 states and 1297417 transitions. [2019-09-08 13:25:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:25:39,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:39,765 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, 1, 1] [2019-09-08 13:25:39,765 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1957480949, now seen corresponding path program 1 times [2019-09-08 13:25:39,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:39,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:39,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:39,901 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:25:39,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:39,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:25:39,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:25:39,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:25:39,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:25:39,902 INFO L87 Difference]: Start difference. First operand 807771 states and 1297417 transitions. Second operand 3 states.