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_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:03:10,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:03:10,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:03:10,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:03:10,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:03:10,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:03:10,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:03:10,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:03:10,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:03:10,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:03:10,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:03:10,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:03:10,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:03:10,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:03:10,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:03:10,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:03:10,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:03:10,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:03:10,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:03:10,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:03:10,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:03:10,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:03:10,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:03:10,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:03:10,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:03:10,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:03:10,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:03:10,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:03:10,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:03:10,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:03:10,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:03:10,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:03:10,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:03:10,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:03:10,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:03:10,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:03:10,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:03:10,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:03:10,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:03:10,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:03:10,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:03:10,773 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 10:03:10,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:03:10,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:03:10,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:03:10,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:03:10,790 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:03:10,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:03:10,790 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:03:10,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:03:10,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:03:10,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:03:10,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:03:10,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:03:10,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:03:10,792 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:03:10,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:03:10,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:03:10,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:03:10,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:03:10,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:03:10,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:03:10,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:03:10,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:03:10,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:03:10,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:03:10,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:03:10,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:03:10,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:03:10,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:03:10,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:03:10,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:03:10,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:03:10,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:03:10,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:03:10,843 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:03:10,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 10:03:10,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e930059/00e5813cb43a46ec9ddbd2004730f890/FLAGa408b1b63 [2019-09-08 10:03:11,628 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:03:11,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 10:03:11,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e930059/00e5813cb43a46ec9ddbd2004730f890/FLAGa408b1b63 [2019-09-08 10:03:11,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e930059/00e5813cb43a46ec9ddbd2004730f890 [2019-09-08 10:03:11,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:03:11,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:03:11,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:03:11,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:03:11,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:03:11,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:03:11" (1/1) ... [2019-09-08 10:03:11,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7715d082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:11, skipping insertion in model container [2019-09-08 10:03:11,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:03:11" (1/1) ... [2019-09-08 10:03:11,804 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:03:11,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:03:13,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:03:13,020 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:03:13,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:03:13,599 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:03:13,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13 WrapperNode [2019-09-08 10:03:13,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:03:13,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:03:13,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:03:13,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:03:13,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (1/1) ... [2019-09-08 10:03:13,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (1/1) ... [2019-09-08 10:03:13,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (1/1) ... [2019-09-08 10:03:13,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (1/1) ... [2019-09-08 10:03:13,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (1/1) ... [2019-09-08 10:03:13,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (1/1) ... [2019-09-08 10:03:13,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (1/1) ... [2019-09-08 10:03:13,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:03:13,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:03:13,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:03:13,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:03:13,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (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 10:03:13,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:03:13,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:03:13,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:03:13,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:03:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:03:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:03:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:03:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:03:13,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:03:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:03:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:03:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:03:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:03:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:03:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:03:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:03:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:03:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:03:13,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:03:13,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:03:17,073 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:03:17,074 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:03:17,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:03:17 BoogieIcfgContainer [2019-09-08 10:03:17,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:03:17,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:03:17,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:03:17,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:03:17,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:03:11" (1/3) ... [2019-09-08 10:03:17,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c593e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:03:17, skipping insertion in model container [2019-09-08 10:03:17,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:03:13" (2/3) ... [2019-09-08 10:03:17,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c593e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:03:17, skipping insertion in model container [2019-09-08 10:03:17,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:03:17" (3/3) ... [2019-09-08 10:03:17,088 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 10:03:17,098 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:03:17,119 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 10:03:17,135 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 10:03:17,175 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:03:17,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:03:17,176 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:03:17,176 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:03:17,176 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:03:17,176 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:03:17,176 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:03:17,176 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:03:17,177 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:03:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states. [2019-09-08 10:03:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 10:03:17,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:17,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:17,240 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1331426633, now seen corresponding path program 1 times [2019-09-08 10:03:17,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:17,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:17,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:17,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:17,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:17,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:17,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:17,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:17,864 INFO L87 Difference]: Start difference. First operand 1126 states. Second operand 4 states. [2019-09-08 10:03:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:18,158 INFO L93 Difference]: Finished difference Result 2062 states and 3540 transitions. [2019-09-08 10:03:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:03:18,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-08 10:03:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:18,184 INFO L225 Difference]: With dead ends: 2062 [2019-09-08 10:03:18,184 INFO L226 Difference]: Without dead ends: 1122 [2019-09-08 10:03:18,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-09-08 10:03:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2019-09-08 10:03:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-09-08 10:03:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1893 transitions. [2019-09-08 10:03:18,328 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1893 transitions. Word has length 154 [2019-09-08 10:03:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:18,329 INFO L475 AbstractCegarLoop]: Abstraction has 1122 states and 1893 transitions. [2019-09-08 10:03:18,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1893 transitions. [2019-09-08 10:03:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 10:03:18,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:18,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:18,346 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1101533262, now seen corresponding path program 1 times [2019-09-08 10:03:18,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:18,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:18,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:18,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:18,766 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 10:03:18,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:18,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:18,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:18,777 INFO L87 Difference]: Start difference. First operand 1122 states and 1893 transitions. Second operand 3 states. [2019-09-08 10:03:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:19,136 INFO L93 Difference]: Finished difference Result 2863 states and 4842 transitions. [2019-09-08 10:03:19,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:19,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-08 10:03:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:19,147 INFO L225 Difference]: With dead ends: 2863 [2019-09-08 10:03:19,148 INFO L226 Difference]: Without dead ends: 1953 [2019-09-08 10:03:19,151 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 10:03:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-08 10:03:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1943. [2019-09-08 10:03:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2019-09-08 10:03:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 3243 transitions. [2019-09-08 10:03:19,234 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 3243 transitions. Word has length 195 [2019-09-08 10:03:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:19,235 INFO L475 AbstractCegarLoop]: Abstraction has 1943 states and 3243 transitions. [2019-09-08 10:03:19,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 3243 transitions. [2019-09-08 10:03:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 10:03:19,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:19,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:19,244 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1272315647, now seen corresponding path program 1 times [2019-09-08 10:03:19,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:19,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:19,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:19,431 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 10:03:19,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:19,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:19,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:19,434 INFO L87 Difference]: Start difference. First operand 1943 states and 3243 transitions. Second operand 3 states. [2019-09-08 10:03:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:19,667 INFO L93 Difference]: Finished difference Result 3242 states and 5456 transitions. [2019-09-08 10:03:19,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:19,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-08 10:03:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:19,686 INFO L225 Difference]: With dead ends: 3242 [2019-09-08 10:03:19,687 INFO L226 Difference]: Without dead ends: 2332 [2019-09-08 10:03:19,697 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 10:03:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-09-08 10:03:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2328. [2019-09-08 10:03:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2019-09-08 10:03:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3899 transitions. [2019-09-08 10:03:19,801 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3899 transitions. Word has length 200 [2019-09-08 10:03:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:19,801 INFO L475 AbstractCegarLoop]: Abstraction has 2328 states and 3899 transitions. [2019-09-08 10:03:19,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3899 transitions. [2019-09-08 10:03:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 10:03:19,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:19,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:19,809 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash 228391092, now seen corresponding path program 1 times [2019-09-08 10:03:19,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:19,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:19,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:19,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:19,997 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 10:03:19,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:19,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:19,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:20,000 INFO L87 Difference]: Start difference. First operand 2328 states and 3899 transitions. Second operand 3 states. [2019-09-08 10:03:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:20,418 INFO L93 Difference]: Finished difference Result 6360 states and 10647 transitions. [2019-09-08 10:03:20,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:20,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-08 10:03:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:20,444 INFO L225 Difference]: With dead ends: 6360 [2019-09-08 10:03:20,444 INFO L226 Difference]: Without dead ends: 4262 [2019-09-08 10:03:20,452 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 10:03:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2019-09-08 10:03:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4241. [2019-09-08 10:03:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2019-09-08 10:03:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 7064 transitions. [2019-09-08 10:03:20,670 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 7064 transitions. Word has length 203 [2019-09-08 10:03:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:20,672 INFO L475 AbstractCegarLoop]: Abstraction has 4241 states and 7064 transitions. [2019-09-08 10:03:20,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 7064 transitions. [2019-09-08 10:03:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 10:03:20,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:20,685 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:20,685 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:20,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:20,686 INFO L82 PathProgramCache]: Analyzing trace with hash 211508577, now seen corresponding path program 1 times [2019-09-08 10:03:20,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:20,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:20,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:20,993 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 10:03:20,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:20,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:20,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:20,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:20,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:20,996 INFO L87 Difference]: Start difference. First operand 4241 states and 7064 transitions. Second operand 3 states. [2019-09-08 10:03:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:21,301 INFO L93 Difference]: Finished difference Result 7498 states and 12552 transitions. [2019-09-08 10:03:21,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:21,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-08 10:03:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:21,328 INFO L225 Difference]: With dead ends: 7498 [2019-09-08 10:03:21,328 INFO L226 Difference]: Without dead ends: 5400 [2019-09-08 10:03:21,334 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 10:03:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5400 states. [2019-09-08 10:03:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5400 to 5396. [2019-09-08 10:03:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2019-09-08 10:03:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 9006 transitions. [2019-09-08 10:03:21,570 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 9006 transitions. Word has length 208 [2019-09-08 10:03:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:21,571 INFO L475 AbstractCegarLoop]: Abstraction has 5396 states and 9006 transitions. [2019-09-08 10:03:21,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 9006 transitions. [2019-09-08 10:03:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 10:03:21,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:21,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:21,583 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1754448046, now seen corresponding path program 1 times [2019-09-08 10:03:21,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:21,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:21,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:21,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:21,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:21,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:21,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:21,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:21,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:21,724 INFO L87 Difference]: Start difference. First operand 5396 states and 9006 transitions. Second operand 3 states. [2019-09-08 10:03:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:22,284 INFO L93 Difference]: Finished difference Result 15240 states and 25370 transitions. [2019-09-08 10:03:22,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:22,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-08 10:03:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:22,362 INFO L225 Difference]: With dead ends: 15240 [2019-09-08 10:03:22,363 INFO L226 Difference]: Without dead ends: 10092 [2019-09-08 10:03:22,381 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 10:03:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2019-09-08 10:03:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10039. [2019-09-08 10:03:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10039 states. [2019-09-08 10:03:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10039 states to 10039 states and 16611 transitions. [2019-09-08 10:03:22,918 INFO L78 Accepts]: Start accepts. Automaton has 10039 states and 16611 transitions. Word has length 211 [2019-09-08 10:03:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:22,919 INFO L475 AbstractCegarLoop]: Abstraction has 10039 states and 16611 transitions. [2019-09-08 10:03:22,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 10039 states and 16611 transitions. [2019-09-08 10:03:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 10:03:22,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:22,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:22,939 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:22,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1719339937, now seen corresponding path program 1 times [2019-09-08 10:03:22,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:22,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:22,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:22,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:22,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:23,083 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 10:03:23,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:23,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:23,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:23,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:23,085 INFO L87 Difference]: Start difference. First operand 10039 states and 16611 transitions. Second operand 3 states. [2019-09-08 10:03:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:23,841 INFO L93 Difference]: Finished difference Result 18172 states and 30225 transitions. [2019-09-08 10:03:23,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:23,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 10:03:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:23,878 INFO L225 Difference]: With dead ends: 18172 [2019-09-08 10:03:23,878 INFO L226 Difference]: Without dead ends: 13024 [2019-09-08 10:03:23,894 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 10:03:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2019-09-08 10:03:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 13020. [2019-09-08 10:03:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-09-08 10:03:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 21569 transitions. [2019-09-08 10:03:24,572 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 21569 transitions. Word has length 216 [2019-09-08 10:03:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:24,573 INFO L475 AbstractCegarLoop]: Abstraction has 13020 states and 21569 transitions. [2019-09-08 10:03:24,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 21569 transitions. [2019-09-08 10:03:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 10:03:24,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:24,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:24,617 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1836932892, now seen corresponding path program 1 times [2019-09-08 10:03:24,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:24,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:24,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:24,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:24,881 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 10:03:24,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:24,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:24,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:24,883 INFO L87 Difference]: Start difference. First operand 13020 states and 21569 transitions. Second operand 3 states. [2019-09-08 10:03:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:26,222 INFO L93 Difference]: Finished difference Result 37230 states and 61407 transitions. [2019-09-08 10:03:26,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:26,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 10:03:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:26,307 INFO L225 Difference]: With dead ends: 37230 [2019-09-08 10:03:26,308 INFO L226 Difference]: Without dead ends: 24476 [2019-09-08 10:03:26,352 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 10:03:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-09-08 10:03:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 24329. [2019-09-08 10:03:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24329 states. [2019-09-08 10:03:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24329 states to 24329 states and 39830 transitions. [2019-09-08 10:03:28,588 INFO L78 Accepts]: Start accepts. Automaton has 24329 states and 39830 transitions. Word has length 219 [2019-09-08 10:03:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:28,589 INFO L475 AbstractCegarLoop]: Abstraction has 24329 states and 39830 transitions. [2019-09-08 10:03:28,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 24329 states and 39830 transitions. [2019-09-08 10:03:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 10:03:28,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:28,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:28,630 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1650860369, now seen corresponding path program 1 times [2019-09-08 10:03:28,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:28,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:28,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:28,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:28,777 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 10:03:28,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:28,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:03:28,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:03:28,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:03:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:03:28,779 INFO L87 Difference]: Start difference. First operand 24329 states and 39830 transitions. Second operand 3 states. [2019-09-08 10:03:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:29,983 INFO L93 Difference]: Finished difference Result 44150 states and 72662 transitions. [2019-09-08 10:03:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:03:29,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-08 10:03:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:30,086 INFO L225 Difference]: With dead ends: 44150 [2019-09-08 10:03:30,086 INFO L226 Difference]: Without dead ends: 31396 [2019-09-08 10:03:30,131 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 10:03:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31396 states. [2019-09-08 10:03:31,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31396 to 31392. [2019-09-08 10:03:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31392 states. [2019-09-08 10:03:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31392 states to 31392 states and 51380 transitions. [2019-09-08 10:03:32,594 INFO L78 Accepts]: Start accepts. Automaton has 31392 states and 51380 transitions. Word has length 224 [2019-09-08 10:03:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:32,594 INFO L475 AbstractCegarLoop]: Abstraction has 31392 states and 51380 transitions. [2019-09-08 10:03:32,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:03:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 31392 states and 51380 transitions. [2019-09-08 10:03:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 10:03:32,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:32,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:32,643 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash -558931230, now seen corresponding path program 1 times [2019-09-08 10:03:32,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:32,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:32,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:32,887 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 10:03:32,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:32,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:03:32,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:03:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:03:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:03:32,889 INFO L87 Difference]: Start difference. First operand 31392 states and 51380 transitions. Second operand 6 states. [2019-09-08 10:03:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:38,661 INFO L93 Difference]: Finished difference Result 198229 states and 327015 transitions. [2019-09-08 10:03:38,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:03:38,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2019-09-08 10:03:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:39,227 INFO L225 Difference]: With dead ends: 198229 [2019-09-08 10:03:39,228 INFO L226 Difference]: Without dead ends: 167115 [2019-09-08 10:03:39,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:03:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167115 states. [2019-09-08 10:03:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167115 to 61340. [2019-09-08 10:03:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61340 states. [2019-09-08 10:03:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61340 states to 61340 states and 99970 transitions. [2019-09-08 10:03:44,741 INFO L78 Accepts]: Start accepts. Automaton has 61340 states and 99970 transitions. Word has length 227 [2019-09-08 10:03:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:44,741 INFO L475 AbstractCegarLoop]: Abstraction has 61340 states and 99970 transitions. [2019-09-08 10:03:44,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:03:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 61340 states and 99970 transitions. [2019-09-08 10:03:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:03:44,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:44,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:44,814 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2028868059, now seen corresponding path program 1 times [2019-09-08 10:03:44,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:44,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:45,184 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 10:03:45,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:45,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:45,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:45,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:45,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:45,186 INFO L87 Difference]: Start difference. First operand 61340 states and 99970 transitions. Second operand 4 states. [2019-09-08 10:03:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:51,712 INFO L93 Difference]: Finished difference Result 201224 states and 329943 transitions. [2019-09-08 10:03:51,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:51,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-08 10:03:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:52,098 INFO L225 Difference]: With dead ends: 201224 [2019-09-08 10:03:52,098 INFO L226 Difference]: Without dead ends: 140162 [2019-09-08 10:03:52,222 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 10:03:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140162 states. [2019-09-08 10:03:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140162 to 100932. [2019-09-08 10:03:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100932 states. [2019-09-08 10:03:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100932 states to 100932 states and 164593 transitions. [2019-09-08 10:03:56,621 INFO L78 Accepts]: Start accepts. Automaton has 100932 states and 164593 transitions. Word has length 229 [2019-09-08 10:03:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:56,622 INFO L475 AbstractCegarLoop]: Abstraction has 100932 states and 164593 transitions. [2019-09-08 10:03:56,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 100932 states and 164593 transitions. [2019-09-08 10:03:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:03:56,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:56,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:56,718 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash 535274507, now seen corresponding path program 1 times [2019-09-08 10:03:56,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:56,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:56,873 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 10:03:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:56,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:56,875 INFO L87 Difference]: Start difference. First operand 100932 states and 164593 transitions. Second operand 4 states. [2019-09-08 10:04:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:07,052 INFO L93 Difference]: Finished difference Result 326567 states and 533830 transitions. [2019-09-08 10:04:07,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:04:07,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-08 10:04:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:07,482 INFO L225 Difference]: With dead ends: 326567 [2019-09-08 10:04:07,483 INFO L226 Difference]: Without dead ends: 225913 [2019-09-08 10:04:07,606 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 10:04:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225913 states. [2019-09-08 10:04:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225913 to 164028. [2019-09-08 10:04:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164028 states. [2019-09-08 10:04:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164028 states to 164028 states and 266622 transitions. [2019-09-08 10:04:17,968 INFO L78 Accepts]: Start accepts. Automaton has 164028 states and 266622 transitions. Word has length 230 [2019-09-08 10:04:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:17,968 INFO L475 AbstractCegarLoop]: Abstraction has 164028 states and 266622 transitions. [2019-09-08 10:04:17,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:04:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 164028 states and 266622 transitions. [2019-09-08 10:04:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 10:04:18,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:18,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:18,068 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:18,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:18,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1949352820, now seen corresponding path program 1 times [2019-09-08 10:04:18,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:18,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:18,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:18,257 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 10:04:18,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:18,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:04:18,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:04:18,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:04:18,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:04:18,259 INFO L87 Difference]: Start difference. First operand 164028 states and 266622 transitions. Second operand 4 states. [2019-09-08 10:04:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:35,873 INFO L93 Difference]: Finished difference Result 526607 states and 858082 transitions. [2019-09-08 10:04:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:04:35,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-08 10:04:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:36,392 INFO L225 Difference]: With dead ends: 526607 [2019-09-08 10:04:36,392 INFO L226 Difference]: Without dead ends: 362857 [2019-09-08 10:04:36,540 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 10:04:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362857 states. [2019-09-08 10:04:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362857 to 263994. [2019-09-08 10:04:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263994 states. [2019-09-08 10:04:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263994 states to 263994 states and 427712 transitions. [2019-09-08 10:04:54,845 INFO L78 Accepts]: Start accepts. Automaton has 263994 states and 427712 transitions. Word has length 231 [2019-09-08 10:04:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:54,846 INFO L475 AbstractCegarLoop]: Abstraction has 263994 states and 427712 transitions. [2019-09-08 10:04:54,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:04:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 263994 states and 427712 transitions. [2019-09-08 10:04:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 10:04:55,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:55,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:55,036 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash -988021564, now seen corresponding path program 1 times [2019-09-08 10:04:55,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:55,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:55,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:55,184 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 10:04:55,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:55,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:04:55,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:04:55,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:04:55,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:04:55,186 INFO L87 Difference]: Start difference. First operand 263994 states and 427712 transitions. Second operand 4 states. [2019-09-08 10:05:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:26,518 INFO L93 Difference]: Finished difference Result 835866 states and 1357540 transitions. [2019-09-08 10:05:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:05:26,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-08 10:05:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:27,762 INFO L225 Difference]: With dead ends: 835866 [2019-09-08 10:05:27,762 INFO L226 Difference]: Without dead ends: 572150 [2019-09-08 10:05:28,010 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 10:05:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572150 states. [2019-09-08 10:06:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572150 to 417860. [2019-09-08 10:06:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417860 states. [2019-09-08 10:06:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417860 states to 417860 states and 674748 transitions. [2019-09-08 10:06:05,849 INFO L78 Accepts]: Start accepts. Automaton has 417860 states and 674748 transitions. Word has length 232 [2019-09-08 10:06:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:05,850 INFO L475 AbstractCegarLoop]: Abstraction has 417860 states and 674748 transitions. [2019-09-08 10:06:05,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:06:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 417860 states and 674748 transitions. [2019-09-08 10:06:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 10:06:06,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:06,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:06:06,144 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:06,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:06,144 INFO L82 PathProgramCache]: Analyzing trace with hash 210512879, now seen corresponding path program 1 times [2019-09-08 10:06:06,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:06,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:06,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 10:06:06,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:06,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:06:06,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:06:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:06:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:06:06,471 INFO L87 Difference]: Start difference. First operand 417860 states and 674748 transitions. Second operand 6 states. [2019-09-08 10:06:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:36,885 INFO L93 Difference]: Finished difference Result 835446 states and 1349062 transitions. [2019-09-08 10:06:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:06:36,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 234 [2019-09-08 10:06:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:37,504 INFO L225 Difference]: With dead ends: 835446 [2019-09-08 10:06:37,504 INFO L226 Difference]: Without dead ends: 417864 [2019-09-08 10:06:38,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:06:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417864 states. [2019-09-08 10:07:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417864 to 417860. [2019-09-08 10:07:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417860 states. [2019-09-08 10:07:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417860 states to 417860 states and 671541 transitions. [2019-09-08 10:07:10,644 INFO L78 Accepts]: Start accepts. Automaton has 417860 states and 671541 transitions. Word has length 234 [2019-09-08 10:07:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:10,645 INFO L475 AbstractCegarLoop]: Abstraction has 417860 states and 671541 transitions. [2019-09-08 10:07:10,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:07:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 417860 states and 671541 transitions. [2019-09-08 10:07:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 10:07:10,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:10,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:10,922 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:10,923 INFO L82 PathProgramCache]: Analyzing trace with hash 243373406, now seen corresponding path program 1 times [2019-09-08 10:07:10,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:10,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:10,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:11,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:11,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:07:11,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:07:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:07:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:07:11,219 INFO L87 Difference]: Start difference. First operand 417860 states and 671541 transitions. Second operand 6 states. [2019-09-08 10:08:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:08,845 INFO L93 Difference]: Finished difference Result 1079243 states and 1746521 transitions. [2019-09-08 10:08:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:08:08,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-08 10:08:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:17,866 INFO L225 Difference]: With dead ends: 1079243 [2019-09-08 10:08:17,866 INFO L226 Difference]: Without dead ends: 916740 [2019-09-08 10:08:18,091 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 10:08:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916740 states. [2019-09-08 10:09:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916740 to 656784. [2019-09-08 10:09:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656784 states. [2019-09-08 10:09:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656784 states to 656784 states and 1055898 transitions. [2019-09-08 10:09:12,076 INFO L78 Accepts]: Start accepts. Automaton has 656784 states and 1055898 transitions. Word has length 237 [2019-09-08 10:09:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:09:12,077 INFO L475 AbstractCegarLoop]: Abstraction has 656784 states and 1055898 transitions. [2019-09-08 10:09:12,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:09:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 656784 states and 1055898 transitions. [2019-09-08 10:09:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 10:09:13,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:09:13,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:13,778 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:09:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:09:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash -111481562, now seen corresponding path program 1 times [2019-09-08 10:09:13,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:09:13,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:09:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:13,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:09:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:09:14,091 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 10:09:14,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:09:14,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:09:14,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:09:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:09:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:09:14,093 INFO L87 Difference]: Start difference. First operand 656784 states and 1055898 transitions. Second operand 6 states. [2019-09-08 10:10:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:10:22,147 INFO L93 Difference]: Finished difference Result 1207939 states and 1955036 transitions. [2019-09-08 10:10:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:10:22,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-08 10:10:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:10:23,769 INFO L225 Difference]: With dead ends: 1207939 [2019-09-08 10:10:23,770 INFO L226 Difference]: Without dead ends: 1051322 [2019-09-08 10:10:24,016 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 10:10:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051322 states. [2019-09-08 10:11:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051322 to 874530. [2019-09-08 10:11:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874530 states. [2019-09-08 10:11:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874530 states to 874530 states and 1408670 transitions. [2019-09-08 10:11:59,461 INFO L78 Accepts]: Start accepts. Automaton has 874530 states and 1408670 transitions. Word has length 237 [2019-09-08 10:11:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:59,461 INFO L475 AbstractCegarLoop]: Abstraction has 874530 states and 1408670 transitions. [2019-09-08 10:11:59,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:11:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 874530 states and 1408670 transitions. [2019-09-08 10:12:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 10:12:00,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:00,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:00,196 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1146880762, now seen corresponding path program 1 times [2019-09-08 10:12:00,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:00,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:00,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:00,497 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 10:12:00,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:00,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:12:00,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:12:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:12:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:12:00,499 INFO L87 Difference]: Start difference. First operand 874530 states and 1408670 transitions. Second operand 6 states. [2019-09-08 10:13:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:19,675 INFO L93 Difference]: Finished difference Result 1276131 states and 2065561 transitions. [2019-09-08 10:13:19,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:13:19,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-08 10:13:19,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:21,512 INFO L225 Difference]: With dead ends: 1276131 [2019-09-08 10:13:21,512 INFO L226 Difference]: Without dead ends: 1118464 [2019-09-08 10:13:21,798 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 10:13:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118464 states.