java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:07:12,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:07:12,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:07:12,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:07:12,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:07:12,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:07:12,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:07:12,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:07:12,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:07:12,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:07:12,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:07:12,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:07:12,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:07:12,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:07:12,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:07:12,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:07:12,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:07:12,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:07:12,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:07:12,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:07:12,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:07:12,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:07:12,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:07:12,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:07:12,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:07:12,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:07:12,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:07:12,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:07:12,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:07:12,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:07:12,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:07:12,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:07:12,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:07:12,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:07:12,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:07:12,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:07:12,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:07:12,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:07:12,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:07:12,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:07:12,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:07:12,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:07:12,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:07:12,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:07:12,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:07:12,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:07:12,129 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:07:12,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:07:12,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:07:12,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:07:12,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:07:12,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:07:12,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:07:12,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:07:12,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:07:12,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:07:12,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:07:12,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:07:12,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:07:12,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:07:12,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:07:12,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:07:12,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:07:12,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:07:12,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:07:12,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:07:12,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:07:12,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:07:12,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:07:12,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:07:12,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:07:12,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:07:12,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:07:12,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:07:12,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:07:12,190 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:07:12,191 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:07:12,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3293fb7/1c853c90719c4821be7bba9f3e534d30/FLAG0989b77cc [2019-09-08 13:07:12,839 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:07:12,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:07:12,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3293fb7/1c853c90719c4821be7bba9f3e534d30/FLAG0989b77cc [2019-09-08 13:07:13,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb3293fb7/1c853c90719c4821be7bba9f3e534d30 [2019-09-08 13:07:13,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:07:13,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:07:13,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:07:13,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:07:13,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:07:13,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:13,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f304cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13, skipping insertion in model container [2019-09-08 13:07:13,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:13,126 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:07:13,209 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:07:13,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:07:13,774 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:07:13,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:07:13,986 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:07:13,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13 WrapperNode [2019-09-08 13:07:13,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:07:13,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:07:13,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:07:13,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:07:13,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:13,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:14,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:14,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:14,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:14,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:14,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... [2019-09-08 13:07:14,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:07:14,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:07:14,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:07:14,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:07:14,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:07:14,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:07:14,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:07:14,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:07:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:07:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:07:14,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:07:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:07:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:07:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:07:14,164 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:07:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:07:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:07:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:07:14,165 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:07:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:07:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:07:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:07:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:07:14,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:07:15,827 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:07:15,827 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:07:15,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:07:15 BoogieIcfgContainer [2019-09-08 13:07:15,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:07:15,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:07:15,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:07:15,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:07:15,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:07:13" (1/3) ... [2019-09-08 13:07:15,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d43e6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:07:15, skipping insertion in model container [2019-09-08 13:07:15,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:07:13" (2/3) ... [2019-09-08 13:07:15,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d43e6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:07:15, skipping insertion in model container [2019-09-08 13:07:15,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:07:15" (3/3) ... [2019-09-08 13:07:15,843 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:07:15,854 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:07:15,880 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:07:15,898 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:07:15,948 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:07:15,949 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:07:15,949 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:07:15,949 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:07:15,949 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:07:15,950 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:07:15,950 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:07:15,950 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:07:15,950 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:07:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2019-09-08 13:07:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 13:07:15,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:15,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:16,001 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash -680724110, now seen corresponding path program 1 times [2019-09-08 13:07:16,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:16,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:17,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:17,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:17,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:17,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:17,053 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 4 states. [2019-09-08 13:07:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:17,353 INFO L93 Difference]: Finished difference Result 1006 states and 1767 transitions. [2019-09-08 13:07:17,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:07:17,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-08 13:07:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:17,392 INFO L225 Difference]: With dead ends: 1006 [2019-09-08 13:07:17,392 INFO L226 Difference]: Without dead ends: 662 [2019-09-08 13:07:17,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-08 13:07:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2019-09-08 13:07:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 13:07:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 961 transitions. [2019-09-08 13:07:17,517 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 961 transitions. Word has length 159 [2019-09-08 13:07:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:17,517 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 961 transitions. [2019-09-08 13:07:17,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 961 transitions. [2019-09-08 13:07:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 13:07:17,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:17,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:17,524 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1230031220, now seen corresponding path program 1 times [2019-09-08 13:07:17,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:17,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:17,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:17,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:17,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:17,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:17,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:17,639 INFO L87 Difference]: Start difference. First operand 660 states and 961 transitions. Second operand 3 states. [2019-09-08 13:07:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:17,697 INFO L93 Difference]: Finished difference Result 1934 states and 2813 transitions. [2019-09-08 13:07:17,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:17,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 13:07:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:17,705 INFO L225 Difference]: With dead ends: 1934 [2019-09-08 13:07:17,706 INFO L226 Difference]: Without dead ends: 1306 [2019-09-08 13:07:17,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-08 13:07:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 662. [2019-09-08 13:07:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-08 13:07:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 963 transitions. [2019-09-08 13:07:17,761 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 963 transitions. Word has length 160 [2019-09-08 13:07:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:17,763 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 963 transitions. [2019-09-08 13:07:17,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 963 transitions. [2019-09-08 13:07:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:07:17,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:17,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:17,770 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 230722581, now seen corresponding path program 1 times [2019-09-08 13:07:17,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:17,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:17,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:17,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:17,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:17,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:17,977 INFO L87 Difference]: Start difference. First operand 662 states and 963 transitions. Second operand 3 states. [2019-09-08 13:07:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:18,073 INFO L93 Difference]: Finished difference Result 1739 states and 2540 transitions. [2019-09-08 13:07:18,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:18,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 13:07:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:18,082 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 13:07:18,082 INFO L226 Difference]: Without dead ends: 1274 [2019-09-08 13:07:18,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-08 13:07:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-08 13:07:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-08 13:07:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1835 transitions. [2019-09-08 13:07:18,147 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1835 transitions. Word has length 161 [2019-09-08 13:07:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:18,148 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1835 transitions. [2019-09-08 13:07:18,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1835 transitions. [2019-09-08 13:07:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 13:07:18,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:18,152 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:18,152 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1877064936, now seen corresponding path program 1 times [2019-09-08 13:07:18,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:18,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:18,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:18,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:18,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:18,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:18,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:18,318 INFO L87 Difference]: Start difference. First operand 1272 states and 1835 transitions. Second operand 4 states. [2019-09-08 13:07:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:18,392 INFO L93 Difference]: Finished difference Result 2060 states and 2985 transitions. [2019-09-08 13:07:18,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:18,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 13:07:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:18,398 INFO L225 Difference]: With dead ends: 2060 [2019-09-08 13:07:18,398 INFO L226 Difference]: Without dead ends: 973 [2019-09-08 13:07:18,401 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 13:07:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-08 13:07:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2019-09-08 13:07:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-09-08 13:07:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1399 transitions. [2019-09-08 13:07:18,490 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1399 transitions. Word has length 161 [2019-09-08 13:07:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:18,490 INFO L475 AbstractCegarLoop]: Abstraction has 973 states and 1399 transitions. [2019-09-08 13:07:18,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1399 transitions. [2019-09-08 13:07:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 13:07:18,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:18,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:18,494 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 916510918, now seen corresponding path program 1 times [2019-09-08 13:07:18,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:18,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:18,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:18,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:18,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:18,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:18,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:18,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:18,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:18,577 INFO L87 Difference]: Start difference. First operand 973 states and 1399 transitions. Second operand 3 states. [2019-09-08 13:07:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:18,682 INFO L93 Difference]: Finished difference Result 2146 states and 3165 transitions. [2019-09-08 13:07:18,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:18,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 13:07:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:18,690 INFO L225 Difference]: With dead ends: 2146 [2019-09-08 13:07:18,690 INFO L226 Difference]: Without dead ends: 1359 [2019-09-08 13:07:18,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-09-08 13:07:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1194. [2019-09-08 13:07:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2019-09-08 13:07:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1757 transitions. [2019-09-08 13:07:18,758 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1757 transitions. Word has length 163 [2019-09-08 13:07:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:18,758 INFO L475 AbstractCegarLoop]: Abstraction has 1194 states and 1757 transitions. [2019-09-08 13:07:18,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1757 transitions. [2019-09-08 13:07:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 13:07:18,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:18,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:18,762 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash -575678253, now seen corresponding path program 1 times [2019-09-08 13:07:18,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:18,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:18,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:18,852 INFO L87 Difference]: Start difference. First operand 1194 states and 1757 transitions. Second operand 3 states. [2019-09-08 13:07:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:18,982 INFO L93 Difference]: Finished difference Result 2666 states and 4024 transitions. [2019-09-08 13:07:18,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:18,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 13:07:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:18,994 INFO L225 Difference]: With dead ends: 2666 [2019-09-08 13:07:18,994 INFO L226 Difference]: Without dead ends: 1742 [2019-09-08 13:07:18,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-08 13:07:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1583. [2019-09-08 13:07:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2019-09-08 13:07:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2386 transitions. [2019-09-08 13:07:19,117 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2386 transitions. Word has length 165 [2019-09-08 13:07:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:19,118 INFO L475 AbstractCegarLoop]: Abstraction has 1583 states and 2386 transitions. [2019-09-08 13:07:19,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2386 transitions. [2019-09-08 13:07:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:07:19,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:19,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:19,123 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:19,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash 866582975, now seen corresponding path program 1 times [2019-09-08 13:07:19,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:19,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:19,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:19,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:19,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:19,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:19,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:19,362 INFO L87 Difference]: Start difference. First operand 1583 states and 2386 transitions. Second operand 4 states. [2019-09-08 13:07:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:19,612 INFO L93 Difference]: Finished difference Result 3749 states and 5839 transitions. [2019-09-08 13:07:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:19,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 13:07:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:19,626 INFO L225 Difference]: With dead ends: 3749 [2019-09-08 13:07:19,627 INFO L226 Difference]: Without dead ends: 2810 [2019-09-08 13:07:19,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2019-09-08 13:07:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2808. [2019-09-08 13:07:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-09-08 13:07:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4292 transitions. [2019-09-08 13:07:19,789 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4292 transitions. Word has length 166 [2019-09-08 13:07:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:19,790 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 4292 transitions. [2019-09-08 13:07:19,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4292 transitions. [2019-09-08 13:07:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 13:07:19,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:19,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:19,794 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 604906342, now seen corresponding path program 1 times [2019-09-08 13:07:19,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:19,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:19,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:19,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:20,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:20,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:20,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:20,048 INFO L87 Difference]: Start difference. First operand 2808 states and 4292 transitions. Second operand 4 states. [2019-09-08 13:07:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:20,477 INFO L93 Difference]: Finished difference Result 7276 states and 11130 transitions. [2019-09-08 13:07:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:20,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-08 13:07:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:20,502 INFO L225 Difference]: With dead ends: 7276 [2019-09-08 13:07:20,502 INFO L226 Difference]: Without dead ends: 4491 [2019-09-08 13:07:20,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2019-09-08 13:07:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4489. [2019-09-08 13:07:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4489 states. [2019-09-08 13:07:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6806 transitions. [2019-09-08 13:07:20,839 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6806 transitions. Word has length 166 [2019-09-08 13:07:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:20,840 INFO L475 AbstractCegarLoop]: Abstraction has 4489 states and 6806 transitions. [2019-09-08 13:07:20,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6806 transitions. [2019-09-08 13:07:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:07:20,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:20,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:20,847 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:20,847 INFO L82 PathProgramCache]: Analyzing trace with hash 108069717, now seen corresponding path program 1 times [2019-09-08 13:07:20,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:20,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:20,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:20,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:20,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:21,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:21,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:21,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:21,022 INFO L87 Difference]: Start difference. First operand 4489 states and 6806 transitions. Second operand 3 states. [2019-09-08 13:07:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:21,430 INFO L93 Difference]: Finished difference Result 12648 states and 19260 transitions. [2019-09-08 13:07:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:21,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 13:07:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:21,473 INFO L225 Difference]: With dead ends: 12648 [2019-09-08 13:07:21,474 INFO L226 Difference]: Without dead ends: 8522 [2019-09-08 13:07:21,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2019-09-08 13:07:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 8520. [2019-09-08 13:07:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8520 states. [2019-09-08 13:07:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8520 states to 8520 states and 12825 transitions. [2019-09-08 13:07:22,070 INFO L78 Accepts]: Start accepts. Automaton has 8520 states and 12825 transitions. Word has length 168 [2019-09-08 13:07:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:22,070 INFO L475 AbstractCegarLoop]: Abstraction has 8520 states and 12825 transitions. [2019-09-08 13:07:22,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8520 states and 12825 transitions. [2019-09-08 13:07:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 13:07:22,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:22,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:22,082 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:22,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1037289934, now seen corresponding path program 1 times [2019-09-08 13:07:22,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:22,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:22,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:22,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:22,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:22,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:22,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:22,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:22,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:22,257 INFO L87 Difference]: Start difference. First operand 8520 states and 12825 transitions. Second operand 4 states. [2019-09-08 13:07:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:22,600 INFO L93 Difference]: Finished difference Result 13537 states and 20401 transitions. [2019-09-08 13:07:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:22,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-08 13:07:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:22,740 INFO L225 Difference]: With dead ends: 13537 [2019-09-08 13:07:22,740 INFO L226 Difference]: Without dead ends: 6942 [2019-09-08 13:07:22,752 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 13:07:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2019-09-08 13:07:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6942. [2019-09-08 13:07:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6942 states. [2019-09-08 13:07:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 10415 transitions. [2019-09-08 13:07:23,088 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 10415 transitions. Word has length 168 [2019-09-08 13:07:23,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:23,089 INFO L475 AbstractCegarLoop]: Abstraction has 6942 states and 10415 transitions. [2019-09-08 13:07:23,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 10415 transitions. [2019-09-08 13:07:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 13:07:23,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:23,097 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:23,097 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:23,097 INFO L82 PathProgramCache]: Analyzing trace with hash -859201449, now seen corresponding path program 1 times [2019-09-08 13:07:23,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:23,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:23,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:23,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:23,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:23,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:23,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:23,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:23,187 INFO L87 Difference]: Start difference. First operand 6942 states and 10415 transitions. Second operand 3 states. [2019-09-08 13:07:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:23,738 INFO L93 Difference]: Finished difference Result 18110 states and 27616 transitions. [2019-09-08 13:07:23,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:23,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 13:07:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:23,767 INFO L225 Difference]: With dead ends: 18110 [2019-09-08 13:07:23,768 INFO L226 Difference]: Without dead ends: 11504 [2019-09-08 13:07:23,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11504 states. [2019-09-08 13:07:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11504 to 10404. [2019-09-08 13:07:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10404 states. [2019-09-08 13:07:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10404 states to 10404 states and 15982 transitions. [2019-09-08 13:07:24,287 INFO L78 Accepts]: Start accepts. Automaton has 10404 states and 15982 transitions. Word has length 172 [2019-09-08 13:07:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:24,287 INFO L475 AbstractCegarLoop]: Abstraction has 10404 states and 15982 transitions. [2019-09-08 13:07:24,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 10404 states and 15982 transitions. [2019-09-08 13:07:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:07:24,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:24,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:24,296 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:24,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:24,296 INFO L82 PathProgramCache]: Analyzing trace with hash -830615246, now seen corresponding path program 1 times [2019-09-08 13:07:24,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:24,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:24,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:24,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:24,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:07:24,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:07:24,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:07:24,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:24,395 INFO L87 Difference]: Start difference. First operand 10404 states and 15982 transitions. Second operand 3 states. [2019-09-08 13:07:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:25,399 INFO L93 Difference]: Finished difference Result 30145 states and 46548 transitions. [2019-09-08 13:07:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:07:25,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 13:07:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:25,464 INFO L225 Difference]: With dead ends: 30145 [2019-09-08 13:07:25,464 INFO L226 Difference]: Without dead ends: 20423 [2019-09-08 13:07:25,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:07:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20423 states. [2019-09-08 13:07:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20423 to 20421. [2019-09-08 13:07:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20421 states. [2019-09-08 13:07:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20421 states to 20421 states and 31282 transitions. [2019-09-08 13:07:26,628 INFO L78 Accepts]: Start accepts. Automaton has 20421 states and 31282 transitions. Word has length 173 [2019-09-08 13:07:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:26,629 INFO L475 AbstractCegarLoop]: Abstraction has 20421 states and 31282 transitions. [2019-09-08 13:07:26,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:07:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20421 states and 31282 transitions. [2019-09-08 13:07:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:07:26,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:26,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:26,641 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1665080627, now seen corresponding path program 1 times [2019-09-08 13:07:26,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:26,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:26,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:26,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:26,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:26,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:07:26,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:07:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:07:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:07:26,861 INFO L87 Difference]: Start difference. First operand 20421 states and 31282 transitions. Second operand 9 states. [2019-09-08 13:07:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:31,740 INFO L93 Difference]: Finished difference Result 107487 states and 165829 transitions. [2019-09-08 13:07:31,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:07:31,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-09-08 13:07:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:31,922 INFO L225 Difference]: With dead ends: 107487 [2019-09-08 13:07:31,922 INFO L226 Difference]: Without dead ends: 87621 [2019-09-08 13:07:31,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-08 13:07:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87621 states. [2019-09-08 13:07:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87621 to 57133. [2019-09-08 13:07:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57133 states. [2019-09-08 13:07:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57133 states to 57133 states and 87258 transitions. [2019-09-08 13:07:36,258 INFO L78 Accepts]: Start accepts. Automaton has 57133 states and 87258 transitions. Word has length 173 [2019-09-08 13:07:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:36,258 INFO L475 AbstractCegarLoop]: Abstraction has 57133 states and 87258 transitions. [2019-09-08 13:07:36,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:07:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 57133 states and 87258 transitions. [2019-09-08 13:07:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:07:36,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:36,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:36,292 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:36,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:36,293 INFO L82 PathProgramCache]: Analyzing trace with hash 972224736, now seen corresponding path program 1 times [2019-09-08 13:07:36,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:36,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:36,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:36,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:36,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:36,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:07:36,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:07:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:07:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:36,451 INFO L87 Difference]: Start difference. First operand 57133 states and 87258 transitions. Second operand 4 states. [2019-09-08 13:07:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:40,284 INFO L93 Difference]: Finished difference Result 120897 states and 187860 transitions. [2019-09-08 13:07:40,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:07:40,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 13:07:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:40,447 INFO L225 Difference]: With dead ends: 120897 [2019-09-08 13:07:40,447 INFO L226 Difference]: Without dead ends: 73231 [2019-09-08 13:07:40,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:07:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73231 states. [2019-09-08 13:07:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73231 to 73229. [2019-09-08 13:07:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73229 states. [2019-09-08 13:07:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73229 states to 73229 states and 112330 transitions. [2019-09-08 13:07:44,075 INFO L78 Accepts]: Start accepts. Automaton has 73229 states and 112330 transitions. Word has length 173 [2019-09-08 13:07:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:07:44,075 INFO L475 AbstractCegarLoop]: Abstraction has 73229 states and 112330 transitions. [2019-09-08 13:07:44,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:07:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 73229 states and 112330 transitions. [2019-09-08 13:07:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:07:44,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:07:44,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:07:44,095 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:07:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:07:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash 774371549, now seen corresponding path program 1 times [2019-09-08 13:07:44,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:07:44,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:07:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:44,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:07:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:07:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:07:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:07:44,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:07:44,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:07:44,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:07:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:07:44,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:44,281 INFO L87 Difference]: Start difference. First operand 73229 states and 112330 transitions. Second operand 5 states. [2019-09-08 13:07:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:07:51,650 INFO L93 Difference]: Finished difference Result 176663 states and 273776 transitions. [2019-09-08 13:07:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:07:51,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-09-08 13:07:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:07:51,923 INFO L225 Difference]: With dead ends: 176663 [2019-09-08 13:07:51,924 INFO L226 Difference]: Without dead ends: 153197 [2019-09-08 13:07:51,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:07:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153197 states. [2019-09-08 13:08:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153197 to 121935. [2019-09-08 13:08:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121935 states. [2019-09-08 13:08:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121935 states to 121935 states and 187660 transitions. [2019-09-08 13:08:00,267 INFO L78 Accepts]: Start accepts. Automaton has 121935 states and 187660 transitions. Word has length 173 [2019-09-08 13:08:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:00,268 INFO L475 AbstractCegarLoop]: Abstraction has 121935 states and 187660 transitions. [2019-09-08 13:08:00,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:08:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 121935 states and 187660 transitions. [2019-09-08 13:08:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:08:00,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:00,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:00,288 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1442256878, now seen corresponding path program 1 times [2019-09-08 13:08:00,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:00,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:00,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:00,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:08:00,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:08:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:08:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:00,400 INFO L87 Difference]: Start difference. First operand 121935 states and 187660 transitions. Second operand 3 states. [2019-09-08 13:08:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:12,713 INFO L93 Difference]: Finished difference Result 326877 states and 506530 transitions. [2019-09-08 13:08:12,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:08:12,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 13:08:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:13,118 INFO L225 Difference]: With dead ends: 326877 [2019-09-08 13:08:13,119 INFO L226 Difference]: Without dead ends: 214191 [2019-09-08 13:08:13,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:08:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214191 states. [2019-09-08 13:08:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214191 to 214189. [2019-09-08 13:08:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214189 states. [2019-09-08 13:08:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214189 states to 214189 states and 329952 transitions. [2019-09-08 13:08:27,176 INFO L78 Accepts]: Start accepts. Automaton has 214189 states and 329952 transitions. Word has length 173 [2019-09-08 13:08:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:08:27,176 INFO L475 AbstractCegarLoop]: Abstraction has 214189 states and 329952 transitions. [2019-09-08 13:08:27,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:08:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 214189 states and 329952 transitions. [2019-09-08 13:08:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 13:08:27,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:08:27,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:08:27,202 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:08:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:08:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash 528423661, now seen corresponding path program 1 times [2019-09-08 13:08:27,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:08:27,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:08:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:08:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:08:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:08:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:08:27,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:08:27,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:08:27,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:08:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:08:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:08:27,421 INFO L87 Difference]: Start difference. First operand 214189 states and 329952 transitions. Second operand 4 states. [2019-09-08 13:08:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:08:50,298 INFO L93 Difference]: Finished difference Result 597200 states and 918275 transitions. [2019-09-08 13:08:50,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:08:50,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-08 13:08:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:08:50,993 INFO L225 Difference]: With dead ends: 597200 [2019-09-08 13:08:50,994 INFO L226 Difference]: Without dead ends: 383054 [2019-09-08 13:08:51,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:08:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383054 states. [2019-09-08 13:09:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383054 to 383052. [2019-09-08 13:09:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383052 states. [2019-09-08 13:09:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383052 states to 383052 states and 582721 transitions. [2019-09-08 13:09:22,318 INFO L78 Accepts]: Start accepts. Automaton has 383052 states and 582721 transitions. Word has length 173 [2019-09-08 13:09:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:09:22,318 INFO L475 AbstractCegarLoop]: Abstraction has 383052 states and 582721 transitions. [2019-09-08 13:09:22,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:09:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 383052 states and 582721 transitions. [2019-09-08 13:09:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 13:09:22,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:09:22,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:09:22,355 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:09:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:09:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2018947067, now seen corresponding path program 1 times [2019-09-08 13:09:22,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:09:22,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:09:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:22,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:09:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:09:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:09:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:09:22,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:09:22,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:09:22,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:09:22,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:09:22,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:09:22,437 INFO L87 Difference]: Start difference. First operand 383052 states and 582721 transitions. Second operand 3 states. [2019-09-08 13:10:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:10,815 INFO L93 Difference]: Finished difference Result 1148950 states and 1747900 transitions. [2019-09-08 13:10:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:10,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 13:10:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:12,227 INFO L225 Difference]: With dead ends: 1148950 [2019-09-08 13:10:12,228 INFO L226 Difference]: Without dead ends: 766010 [2019-09-08 13:10:12,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766010 states. [2019-09-08 13:10:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766010 to 383058. [2019-09-08 13:10:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383058 states. [2019-09-08 13:10:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383058 states to 383058 states and 582727 transitions. [2019-09-08 13:10:57,943 INFO L78 Accepts]: Start accepts. Automaton has 383058 states and 582727 transitions. Word has length 174 [2019-09-08 13:10:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:57,943 INFO L475 AbstractCegarLoop]: Abstraction has 383058 states and 582727 transitions. [2019-09-08 13:10:57,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 383058 states and 582727 transitions. [2019-09-08 13:10:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:10:57,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:57,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:10:57,984 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:57,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1286910388, now seen corresponding path program 1 times [2019-09-08 13:10:57,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:57,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:10:58,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:58,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:58,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:58,131 INFO L87 Difference]: Start difference. First operand 383058 states and 582727 transitions. Second operand 4 states. [2019-09-08 13:11:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:27,886 INFO L93 Difference]: Finished difference Result 766002 states and 1165309 transitions. [2019-09-08 13:11:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:11:27,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:11:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:28,543 INFO L225 Difference]: With dead ends: 766002 [2019-09-08 13:11:28,543 INFO L226 Difference]: Without dead ends: 383058 [2019-09-08 13:11:28,796 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 13:11:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383058 states. [2019-09-08 13:12:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383058 to 383055. [2019-09-08 13:12:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383055 states. [2019-09-08 13:12:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383055 states to 383055 states and 582720 transitions. [2019-09-08 13:12:01,431 INFO L78 Accepts]: Start accepts. Automaton has 383055 states and 582720 transitions. Word has length 175 [2019-09-08 13:12:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:01,431 INFO L475 AbstractCegarLoop]: Abstraction has 383055 states and 582720 transitions. [2019-09-08 13:12:01,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:12:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 383055 states and 582720 transitions. [2019-09-08 13:12:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:12:01,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:01,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:12:01,470 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:01,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1431746001, now seen corresponding path program 1 times [2019-09-08 13:12:01,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:01,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:01,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:12:01,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:01,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:12:01,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:12:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:12:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:12:01,602 INFO L87 Difference]: Start difference. First operand 383055 states and 582720 transitions. Second operand 4 states. [2019-09-08 13:12:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:31,299 INFO L93 Difference]: Finished difference Result 766067 states and 1165381 transitions. [2019-09-08 13:12:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:12:31,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 13:12:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:32,002 INFO L225 Difference]: With dead ends: 766067 [2019-09-08 13:12:32,002 INFO L226 Difference]: Without dead ends: 383049 [2019-09-08 13:12:32,305 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 13:12:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383049 states. [2019-09-08 13:13:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383049 to 383049. [2019-09-08 13:13:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383049 states. [2019-09-08 13:13:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383049 states to 383049 states and 582708 transitions. [2019-09-08 13:13:04,454 INFO L78 Accepts]: Start accepts. Automaton has 383049 states and 582708 transitions. Word has length 175 [2019-09-08 13:13:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:04,454 INFO L475 AbstractCegarLoop]: Abstraction has 383049 states and 582708 transitions. [2019-09-08 13:13:04,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:13:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 383049 states and 582708 transitions. [2019-09-08 13:13:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 13:13:04,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:04,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:13:04,485 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2115386092, now seen corresponding path program 1 times [2019-09-08 13:13:04,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:04,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:04,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:04,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:04,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:13:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:13:04,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:13:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:13:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:13:04,586 INFO L87 Difference]: Start difference. First operand 383049 states and 582708 transitions. Second operand 3 states. [2019-09-08 13:13:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:46,093 INFO L93 Difference]: Finished difference Result 939797 states and 1428100 transitions. [2019-09-08 13:13:46,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:13:46,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 13:13:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:47,124 INFO L225 Difference]: With dead ends: 939797 [2019-09-08 13:13:47,124 INFO L226 Difference]: Without dead ends: 557779 [2019-09-08 13:13:47,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:13:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557779 states. [2019-09-08 13:14:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557779 to 557777. [2019-09-08 13:14:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557777 states. [2019-09-08 13:14:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557777 states to 557777 states and 838356 transitions. [2019-09-08 13:14:33,686 INFO L78 Accepts]: Start accepts. Automaton has 557777 states and 838356 transitions. Word has length 175 [2019-09-08 13:14:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:33,687 INFO L475 AbstractCegarLoop]: Abstraction has 557777 states and 838356 transitions. [2019-09-08 13:14:33,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 557777 states and 838356 transitions. [2019-09-08 13:14:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:14:33,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:33,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:33,730 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:33,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -425393913, now seen corresponding path program 1 times [2019-09-08 13:14:33,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:33,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:33,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:33,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:33,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:33,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:33,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:33,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:33,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:33,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:33,854 INFO L87 Difference]: Start difference. First operand 557777 states and 838356 transitions. Second operand 3 states. [2019-09-08 13:15:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:42,084 INFO L93 Difference]: Finished difference Result 1344655 states and 2014976 transitions. [2019-09-08 13:15:42,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:42,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 13:15:42,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:43,715 INFO L225 Difference]: With dead ends: 1344655 [2019-09-08 13:15:43,715 INFO L226 Difference]: Without dead ends: 840683 [2019-09-08 13:15:44,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840683 states. [2019-09-08 13:16:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840683 to 764107. [2019-09-08 13:16:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764107 states. [2019-09-08 13:16:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764107 states to 764107 states and 1125358 transitions. [2019-09-08 13:16:49,994 INFO L78 Accepts]: Start accepts. Automaton has 764107 states and 1125358 transitions. Word has length 180 [2019-09-08 13:16:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:49,995 INFO L475 AbstractCegarLoop]: Abstraction has 764107 states and 1125358 transitions. [2019-09-08 13:16:49,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 764107 states and 1125358 transitions. [2019-09-08 13:16:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 13:16:50,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:50,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:16:50,041 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2108470470, now seen corresponding path program 1 times [2019-09-08 13:16:50,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:50,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:50,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:16:50,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:50,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:16:50,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:16:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:16:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:16:50,169 INFO L87 Difference]: Start difference. First operand 764107 states and 1125358 transitions. Second operand 4 states.