java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:12:48,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:12:48,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:12:49,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:12:49,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:12:49,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:12:49,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:12:49,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:12:49,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:12:49,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:12:49,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:12:49,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:12:49,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:12:49,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:12:49,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:12:49,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:12:49,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:12:49,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:12:49,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:12:49,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:12:49,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:12:49,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:12:49,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:12:49,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:12:49,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:12:49,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:12:49,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:12:49,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:12:49,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:12:49,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:12:49,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:12:49,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:12:49,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:12:49,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:12:49,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:12:49,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:12:49,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:12:49,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:12:49,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:12:49,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:12:49,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:12:49,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 08:12:49,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:12:49,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:12:49,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:12:49,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:12:49,098 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:12:49,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:12:49,098 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:12:49,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:12:49,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:12:49,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:12:49,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:12:49,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:12:49,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:12:49,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:12:49,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:12:49,100 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:12:49,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:12:49,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:12:49,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:12:49,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:12:49,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:12:49,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:12:49,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:12:49,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:12:49,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:12:49,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:12:49,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:12:49,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:12:49,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:12:49,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:12:49,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:12:49,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:12:49,155 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:12:49,156 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:12:49,156 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-08 08:12:49,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039592ab6/3995bade9b094ee48523af225e587f3d/FLAGa7efe2f26 [2019-09-08 08:12:49,728 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:12:49,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-08 08:12:49,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039592ab6/3995bade9b094ee48523af225e587f3d/FLAGa7efe2f26 [2019-09-08 08:12:50,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039592ab6/3995bade9b094ee48523af225e587f3d [2019-09-08 08:12:50,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:12:50,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:12:50,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:12:50,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:12:50,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:12:50,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111c15b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50, skipping insertion in model container [2019-09-08 08:12:50,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,112 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:12:50,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:12:50,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:12:50,573 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:12:50,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:12:50,711 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:12:50,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50 WrapperNode [2019-09-08 08:12:50,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:12:50,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:12:50,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:12:50,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:12:50,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... [2019-09-08 08:12:50,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:12:50,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:12:50,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:12:50,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:12:50,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:12:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:12:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:12:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:12:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:12:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:12:50,833 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:12:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:12:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:12:50,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:12:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:12:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:12:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:12:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:12:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:12:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:12:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:12:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:12:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:12:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:12:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:12:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:12:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:12:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:12:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:12:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:12:51,692 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:12:51,693 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:12:51,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:12:51 BoogieIcfgContainer [2019-09-08 08:12:51,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:12:51,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:12:51,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:12:51,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:12:51,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:12:50" (1/3) ... [2019-09-08 08:12:51,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78be5f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:12:51, skipping insertion in model container [2019-09-08 08:12:51,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:50" (2/3) ... [2019-09-08 08:12:51,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78be5f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:12:51, skipping insertion in model container [2019-09-08 08:12:51,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:12:51" (3/3) ... [2019-09-08 08:12:51,703 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-08 08:12:51,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:12:51,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:12:51,740 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:12:51,774 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:12:51,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:12:51,775 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:12:51,775 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:12:51,775 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:12:51,775 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:12:51,776 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:12:51,776 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:12:51,776 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:12:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-09-08 08:12:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 08:12:51,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:51,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] [2019-09-08 08:12:51,811 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1222599780, now seen corresponding path program 1 times [2019-09-08 08:12:51,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:51,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:51,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:51,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:12:52,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:52,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:12:52,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:12:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:12:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:12:52,295 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 5 states. [2019-09-08 08:12:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:52,445 INFO L93 Difference]: Finished difference Result 279 states and 447 transitions. [2019-09-08 08:12:52,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:12:52,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 08:12:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:52,467 INFO L225 Difference]: With dead ends: 279 [2019-09-08 08:12:52,468 INFO L226 Difference]: Without dead ends: 168 [2019-09-08 08:12:52,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:12:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-08 08:12:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-08 08:12:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-08 08:12:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-09-08 08:12:52,592 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 59 [2019-09-08 08:12:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:52,592 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-09-08 08:12:52,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:12:52,593 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2019-09-08 08:12:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 08:12:52,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:52,599 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:12:52,600 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1294429502, now seen corresponding path program 1 times [2019-09-08 08:12:52,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:52,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:12:52,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:52,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:12:52,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:12:52,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:12:52,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:12:52,966 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand 9 states. [2019-09-08 08:12:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:56,000 INFO L93 Difference]: Finished difference Result 1074 states and 1664 transitions. [2019-09-08 08:12:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 08:12:56,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 08:12:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:56,038 INFO L225 Difference]: With dead ends: 1074 [2019-09-08 08:12:56,039 INFO L226 Difference]: Without dead ends: 972 [2019-09-08 08:12:56,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 08:12:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-09-08 08:12:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 664. [2019-09-08 08:12:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-08 08:12:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1017 transitions. [2019-09-08 08:12:56,190 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1017 transitions. Word has length 88 [2019-09-08 08:12:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:56,191 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1017 transitions. [2019-09-08 08:12:56,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:12:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1017 transitions. [2019-09-08 08:12:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 08:12:56,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:56,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:12:56,204 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1877557831, now seen corresponding path program 1 times [2019-09-08 08:12:56,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:56,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:56,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:56,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:12:56,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:56,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:12:56,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:12:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:12:56,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:12:56,412 INFO L87 Difference]: Start difference. First operand 664 states and 1017 transitions. Second operand 6 states. [2019-09-08 08:12:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:57,487 INFO L93 Difference]: Finished difference Result 1882 states and 2913 transitions. [2019-09-08 08:12:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:12:57,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 08:12:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:57,498 INFO L225 Difference]: With dead ends: 1882 [2019-09-08 08:12:57,499 INFO L226 Difference]: Without dead ends: 1284 [2019-09-08 08:12:57,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:12:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-08 08:12:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 974. [2019-09-08 08:12:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-08 08:12:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1495 transitions. [2019-09-08 08:12:57,594 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1495 transitions. Word has length 89 [2019-09-08 08:12:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:57,595 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1495 transitions. [2019-09-08 08:12:57,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:12:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1495 transitions. [2019-09-08 08:12:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:12:57,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:57,598 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:12:57,598 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:57,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1476602283, now seen corresponding path program 1 times [2019-09-08 08:12:57,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:57,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:57,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:12:57,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:57,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:12:57,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:12:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:12:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:12:57,723 INFO L87 Difference]: Start difference. First operand 974 states and 1495 transitions. Second operand 6 states. [2019-09-08 08:12:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:59,206 INFO L93 Difference]: Finished difference Result 5433 states and 8433 transitions. [2019-09-08 08:12:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:12:59,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 08:12:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:59,238 INFO L225 Difference]: With dead ends: 5433 [2019-09-08 08:12:59,238 INFO L226 Difference]: Without dead ends: 4525 [2019-09-08 08:12:59,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:12:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2019-09-08 08:12:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4499. [2019-09-08 08:12:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-09-08 08:12:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 6940 transitions. [2019-09-08 08:12:59,453 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 6940 transitions. Word has length 90 [2019-09-08 08:12:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:59,454 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 6940 transitions. [2019-09-08 08:12:59,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:12:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 6940 transitions. [2019-09-08 08:12:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 08:12:59,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:59,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:12:59,457 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:59,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1983567120, now seen corresponding path program 1 times [2019-09-08 08:12:59,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:59,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:12:59,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:59,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:12:59,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:12:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:12:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:12:59,562 INFO L87 Difference]: Start difference. First operand 4499 states and 6940 transitions. Second operand 6 states. [2019-09-08 08:13:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:01,141 INFO L93 Difference]: Finished difference Result 23027 states and 35626 transitions. [2019-09-08 08:13:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:01,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 08:13:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:01,299 INFO L225 Difference]: With dead ends: 23027 [2019-09-08 08:13:01,299 INFO L226 Difference]: Without dead ends: 18594 [2019-09-08 08:13:01,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:13:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18594 states. [2019-09-08 08:13:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18594 to 18508. [2019-09-08 08:13:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-09-08 08:13:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 28504 transitions. [2019-09-08 08:13:02,441 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 28504 transitions. Word has length 91 [2019-09-08 08:13:02,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:02,442 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 28504 transitions. [2019-09-08 08:13:02,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 28504 transitions. [2019-09-08 08:13:02,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 08:13:02,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:02,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:02,446 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:02,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:02,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1312570520, now seen corresponding path program 1 times [2019-09-08 08:13:02,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:02,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:02,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:13:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:13:02,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:13:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:13:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:13:02,529 INFO L87 Difference]: Start difference. First operand 18508 states and 28504 transitions. Second operand 4 states. [2019-09-08 08:13:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:04,320 INFO L93 Difference]: Finished difference Result 65951 states and 102668 transitions. [2019-09-08 08:13:04,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:13:04,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 08:13:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:04,709 INFO L225 Difference]: With dead ends: 65951 [2019-09-08 08:13:04,710 INFO L226 Difference]: Without dead ends: 47509 [2019-09-08 08:13:04,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:13:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47509 states. [2019-09-08 08:13:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47509 to 46966. [2019-09-08 08:13:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46966 states. [2019-09-08 08:13:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46966 states to 46966 states and 71832 transitions. [2019-09-08 08:13:06,895 INFO L78 Accepts]: Start accepts. Automaton has 46966 states and 71832 transitions. Word has length 93 [2019-09-08 08:13:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:06,896 INFO L475 AbstractCegarLoop]: Abstraction has 46966 states and 71832 transitions. [2019-09-08 08:13:06,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:13:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 46966 states and 71832 transitions. [2019-09-08 08:13:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 08:13:06,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:06,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:06,907 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:06,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1013214077, now seen corresponding path program 1 times [2019-09-08 08:13:06,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:06,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:06,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:13:07,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:07,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:07,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:07,034 INFO L87 Difference]: Start difference. First operand 46966 states and 71832 transitions. Second operand 5 states. [2019-09-08 08:13:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:10,368 INFO L93 Difference]: Finished difference Result 114277 states and 177807 transitions. [2019-09-08 08:13:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:13:10,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 08:13:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:10,797 INFO L225 Difference]: With dead ends: 114277 [2019-09-08 08:13:10,797 INFO L226 Difference]: Without dead ends: 95528 [2019-09-08 08:13:10,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95528 states. [2019-09-08 08:13:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95528 to 95073. [2019-09-08 08:13:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95073 states. [2019-09-08 08:13:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95073 states to 95073 states and 147032 transitions. [2019-09-08 08:13:14,447 INFO L78 Accepts]: Start accepts. Automaton has 95073 states and 147032 transitions. Word has length 94 [2019-09-08 08:13:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:14,448 INFO L475 AbstractCegarLoop]: Abstraction has 95073 states and 147032 transitions. [2019-09-08 08:13:14,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 95073 states and 147032 transitions. [2019-09-08 08:13:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:13:14,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:14,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:14,452 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash -27207661, now seen corresponding path program 1 times [2019-09-08 08:13:14,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:14,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:14,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:13:14,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:14,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:14,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:14,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:14,598 INFO L87 Difference]: Start difference. First operand 95073 states and 147032 transitions. Second operand 5 states. [2019-09-08 08:13:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:20,219 INFO L93 Difference]: Finished difference Result 282925 states and 445163 transitions. [2019-09-08 08:13:20,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:13:20,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 08:13:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:21,003 INFO L225 Difference]: With dead ends: 282925 [2019-09-08 08:13:21,003 INFO L226 Difference]: Without dead ends: 187866 [2019-09-08 08:13:21,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187866 states. [2019-09-08 08:13:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187866 to 187864. [2019-09-08 08:13:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187864 states. [2019-09-08 08:13:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187864 states to 187864 states and 286861 transitions. [2019-09-08 08:13:32,341 INFO L78 Accepts]: Start accepts. Automaton has 187864 states and 286861 transitions. Word has length 95 [2019-09-08 08:13:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:32,341 INFO L475 AbstractCegarLoop]: Abstraction has 187864 states and 286861 transitions. [2019-09-08 08:13:32,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 187864 states and 286861 transitions. [2019-09-08 08:13:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:13:32,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:32,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:32,350 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1036384240, now seen corresponding path program 1 times [2019-09-08 08:13:32,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:32,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:32,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:13:32,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:32,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:13:32,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:13:32,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:13:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:13:32,498 INFO L87 Difference]: Start difference. First operand 187864 states and 286861 transitions. Second operand 11 states. [2019-09-08 08:13:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:41,725 INFO L93 Difference]: Finished difference Result 427179 states and 670307 transitions. [2019-09-08 08:13:41,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:13:41,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-09-08 08:13:41,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:42,913 INFO L225 Difference]: With dead ends: 427179 [2019-09-08 08:13:42,914 INFO L226 Difference]: Without dead ends: 266763 [2019-09-08 08:13:43,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:13:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266763 states. [2019-09-08 08:13:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266763 to 197311. [2019-09-08 08:13:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197311 states. [2019-09-08 08:13:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197311 states to 197311 states and 305046 transitions. [2019-09-08 08:13:55,571 INFO L78 Accepts]: Start accepts. Automaton has 197311 states and 305046 transitions. Word has length 95 [2019-09-08 08:13:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:55,571 INFO L475 AbstractCegarLoop]: Abstraction has 197311 states and 305046 transitions. [2019-09-08 08:13:55,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:13:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 197311 states and 305046 transitions. [2019-09-08 08:13:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:13:55,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:55,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:55,578 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1101664622, now seen corresponding path program 1 times [2019-09-08 08:13:55,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:55,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:13:55,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:55,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:13:55,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:13:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:13:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:55,677 INFO L87 Difference]: Start difference. First operand 197311 states and 305046 transitions. Second operand 7 states. [2019-09-08 08:14:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:02,970 INFO L93 Difference]: Finished difference Result 411122 states and 637822 transitions. [2019-09-08 08:14:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:14:02,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 08:14:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:03,749 INFO L225 Difference]: With dead ends: 411122 [2019-09-08 08:14:03,750 INFO L226 Difference]: Without dead ends: 271463 [2019-09-08 08:14:03,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:14:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271463 states. [2019-09-08 08:14:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271463 to 270585. [2019-09-08 08:14:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270585 states. [2019-09-08 08:14:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270585 states to 270585 states and 419206 transitions. [2019-09-08 08:14:17,235 INFO L78 Accepts]: Start accepts. Automaton has 270585 states and 419206 transitions. Word has length 95 [2019-09-08 08:14:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:17,235 INFO L475 AbstractCegarLoop]: Abstraction has 270585 states and 419206 transitions. [2019-09-08 08:14:17,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:14:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 270585 states and 419206 transitions. [2019-09-08 08:14:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:14:17,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:17,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:14:17,241 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1444462806, now seen corresponding path program 1 times [2019-09-08 08:14:17,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:17,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:17,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:14:17,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:17,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:14:17,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:14:17,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:14:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:14:17,404 INFO L87 Difference]: Start difference. First operand 270585 states and 419206 transitions. Second operand 11 states. [2019-09-08 08:14:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:36,748 INFO L93 Difference]: Finished difference Result 610482 states and 968157 transitions. [2019-09-08 08:14:36,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:14:36,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-09-08 08:14:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:38,018 INFO L225 Difference]: With dead ends: 610482 [2019-09-08 08:14:38,018 INFO L226 Difference]: Without dead ends: 367885 [2019-09-08 08:14:38,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:14:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367885 states. [2019-09-08 08:14:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367885 to 267049. [2019-09-08 08:14:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267049 states. [2019-09-08 08:14:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267049 states to 267049 states and 410276 transitions. [2019-09-08 08:14:55,028 INFO L78 Accepts]: Start accepts. Automaton has 267049 states and 410276 transitions. Word has length 95 [2019-09-08 08:14:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:55,028 INFO L475 AbstractCegarLoop]: Abstraction has 267049 states and 410276 transitions. [2019-09-08 08:14:55,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:14:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 267049 states and 410276 transitions. [2019-09-08 08:14:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:14:55,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:55,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:14:55,033 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:55,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1417757155, now seen corresponding path program 1 times [2019-09-08 08:14:55,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:55,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:55,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:55,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:14:55,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:55,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:14:55,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:14:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:14:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:55,181 INFO L87 Difference]: Start difference. First operand 267049 states and 410276 transitions. Second operand 5 states. [2019-09-08 08:15:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:07,454 INFO L93 Difference]: Finished difference Result 629373 states and 971007 transitions. [2019-09-08 08:15:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:15:07,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:15:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:08,703 INFO L225 Difference]: With dead ends: 629373 [2019-09-08 08:15:08,703 INFO L226 Difference]: Without dead ends: 362495 [2019-09-08 08:15:09,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:15:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362495 states. [2019-09-08 08:15:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362495 to 350857. [2019-09-08 08:15:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350857 states. [2019-09-08 08:15:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350857 states to 350857 states and 538923 transitions. [2019-09-08 08:15:32,825 INFO L78 Accepts]: Start accepts. Automaton has 350857 states and 538923 transitions. Word has length 96 [2019-09-08 08:15:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:32,825 INFO L475 AbstractCegarLoop]: Abstraction has 350857 states and 538923 transitions. [2019-09-08 08:15:32,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:15:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 350857 states and 538923 transitions. [2019-09-08 08:15:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:15:32,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:32,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:15:32,830 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1696645317, now seen corresponding path program 1 times [2019-09-08 08:15:32,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:32,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:32,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:32,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:32,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:32,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 08:15:32,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:32,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:15:32,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:15:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:15:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:15:32,875 INFO L87 Difference]: Start difference. First operand 350857 states and 538923 transitions. Second operand 3 states. [2019-09-08 08:15:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:44,677 INFO L93 Difference]: Finished difference Result 524245 states and 805022 transitions. [2019-09-08 08:15:44,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:15:44,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 08:15:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:45,900 INFO L225 Difference]: With dead ends: 524245 [2019-09-08 08:15:45,900 INFO L226 Difference]: Without dead ends: 350959 [2019-09-08 08:15:46,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:15:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350959 states. [2019-09-08 08:15:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350959 to 350859. [2019-09-08 08:15:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350859 states. [2019-09-08 08:16:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350859 states to 350859 states and 538925 transitions. [2019-09-08 08:16:09,884 INFO L78 Accepts]: Start accepts. Automaton has 350859 states and 538925 transitions. Word has length 96 [2019-09-08 08:16:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:16:09,884 INFO L475 AbstractCegarLoop]: Abstraction has 350859 states and 538925 transitions. [2019-09-08 08:16:09,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:16:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 350859 states and 538925 transitions. [2019-09-08 08:16:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:16:09,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:16:09,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:16:09,889 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:16:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:16:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546431, now seen corresponding path program 1 times [2019-09-08 08:16:09,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:16:09,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:16:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:09,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:16:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:16:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:16:10,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:16:10,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:16:10,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:16:10,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:16:10,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:16:10,005 INFO L87 Difference]: Start difference. First operand 350859 states and 538925 transitions. Second operand 4 states. [2019-09-08 08:16:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:16:25,624 INFO L93 Difference]: Finished difference Result 701698 states and 1077824 transitions. [2019-09-08 08:16:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:16:25,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 08:16:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:16:27,566 INFO L225 Difference]: With dead ends: 701698 [2019-09-08 08:16:27,566 INFO L226 Difference]: Without dead ends: 350856 [2019-09-08 08:16:28,026 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 08:16:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350856 states. [2019-09-08 08:16:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350856 to 350856. [2019-09-08 08:16:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350856 states. [2019-09-08 08:16:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350856 states to 350856 states and 538919 transitions. [2019-09-08 08:16:53,024 INFO L78 Accepts]: Start accepts. Automaton has 350856 states and 538919 transitions. Word has length 97 [2019-09-08 08:16:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:16:53,024 INFO L475 AbstractCegarLoop]: Abstraction has 350856 states and 538919 transitions. [2019-09-08 08:16:53,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:16:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 350856 states and 538919 transitions. [2019-09-08 08:16:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:16:53,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:16:53,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:16:53,029 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:16:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:16:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1912897000, now seen corresponding path program 1 times [2019-09-08 08:16:53,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:16:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:16:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:53,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:16:53,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:16:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:16:53,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:16:53,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:16:53,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:16:53,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:16:53,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:16:53,138 INFO L87 Difference]: Start difference. First operand 350856 states and 538919 transitions. Second operand 5 states. [2019-09-08 08:17:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:17:14,065 INFO L93 Difference]: Finished difference Result 874963 states and 1369571 transitions. [2019-09-08 08:17:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:17:14,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 08:17:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:17:15,725 INFO L225 Difference]: With dead ends: 874963 [2019-09-08 08:17:15,725 INFO L226 Difference]: Without dead ends: 524140 [2019-09-08 08:17:17,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:17:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524140 states. [2019-09-08 08:17:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524140 to 524138. [2019-09-08 08:17:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524138 states. [2019-09-08 08:17:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524138 states to 524138 states and 795246 transitions. [2019-09-08 08:17:51,422 INFO L78 Accepts]: Start accepts. Automaton has 524138 states and 795246 transitions. Word has length 97 [2019-09-08 08:17:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:17:51,422 INFO L475 AbstractCegarLoop]: Abstraction has 524138 states and 795246 transitions. [2019-09-08 08:17:51,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:17:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 524138 states and 795246 transitions. [2019-09-08 08:17:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:17:51,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:17:51,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:17:51,426 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:17:51,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:17:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1016547523, now seen corresponding path program 1 times [2019-09-08 08:17:51,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:17:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:17:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:51,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:17:51,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:17:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:17:51,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:17:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:17:51,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:17:51,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:17:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:17:51,599 INFO L87 Difference]: Start difference. First operand 524138 states and 795246 transitions. Second operand 5 states. [2019-09-08 08:18:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:39,495 INFO L93 Difference]: Finished difference Result 1545218 states and 2407142 transitions. [2019-09-08 08:18:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:18:39,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 08:18:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:42,536 INFO L225 Difference]: With dead ends: 1545218 [2019-09-08 08:18:42,537 INFO L226 Difference]: Without dead ends: 1021118 [2019-09-08 08:18:44,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:18:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021118 states. [2019-09-08 08:19:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021118 to 1021116. [2019-09-08 08:19:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021116 states. [2019-09-08 08:19:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021116 states to 1021116 states and 1525284 transitions. [2019-09-08 08:19:53,150 INFO L78 Accepts]: Start accepts. Automaton has 1021116 states and 1525284 transitions. Word has length 98 [2019-09-08 08:19:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:53,151 INFO L475 AbstractCegarLoop]: Abstraction has 1021116 states and 1525284 transitions. [2019-09-08 08:19:53,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:19:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1021116 states and 1525284 transitions. [2019-09-08 08:19:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:19:53,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:53,158 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] [2019-09-08 08:19:53,158 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:53,159 INFO L82 PathProgramCache]: Analyzing trace with hash -617847026, now seen corresponding path program 1 times [2019-09-08 08:19:53,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:53,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:53,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:53,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:19:53,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:53,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:19:53,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:19:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:19:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:19:53,278 INFO L87 Difference]: Start difference. First operand 1021116 states and 1525284 transitions. Second operand 5 states.