java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:01:10,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:01:10,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:01:10,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:01:10,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:01:10,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:01:10,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:01:10,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:01:10,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:01:10,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:01:10,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:01:10,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:01:10,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:01:10,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:01:10,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:01:10,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:01:10,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:01:10,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:01:10,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:01:10,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:01:10,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:01:10,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:01:10,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:01:10,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:01:10,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:01:10,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:01:10,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:01:10,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:01:10,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:01:10,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:01:10,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:01:10,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:01:10,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:01:10,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:01:10,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:01:10,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:01:10,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:01:10,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:01:10,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:01:10,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:01:10,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:01:10,291 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 07:01:10,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:01:10,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:01:10,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:01:10,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:01:10,311 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:01:10,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:01:10,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:01:10,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:01:10,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:01:10,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:01:10,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:01:10,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:01:10,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:01:10,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:01:10,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:01:10,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:01:10,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:01:10,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:01:10,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:01:10,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:01:10,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:01:10,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:01:10,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:01:10,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:01:10,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:01:10,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:01:10,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:01:10,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:01:10,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:01:10,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:01:10,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:01:10,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:01:10,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:01:10,365 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:01:10,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2019-09-08 07:01:10,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9ed9afb/56684c7d10464238b3ce1331a296cea4/FLAGb05af8ce6 [2019-09-08 07:01:10,964 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:01:10,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2019-09-08 07:01:10,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9ed9afb/56684c7d10464238b3ce1331a296cea4/FLAGb05af8ce6 [2019-09-08 07:01:11,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9ed9afb/56684c7d10464238b3ce1331a296cea4 [2019-09-08 07:01:11,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:01:11,276 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:01:11,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:01:11,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:01:11,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:01:11,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e8182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11, skipping insertion in model container [2019-09-08 07:01:11,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,293 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:01:11,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:01:11,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:01:11,665 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:01:11,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:01:11,850 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:01:11,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11 WrapperNode [2019-09-08 07:01:11,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:01:11,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:01:11,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:01:11,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:01:11,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (1/1) ... [2019-09-08 07:01:11,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:01:11,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:01:11,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:01:11,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:01:11,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (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 07:01:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:01:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:01:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-09-08 07:01:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-09-08 07:01:11,984 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-09-08 07:01:11,984 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-09-08 07:01:11,984 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-09-08 07:01:11,984 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-09-08 07:01:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-09-08 07:01:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-09-08 07:01:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:01:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-09-08 07:01:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-09-08 07:01:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-09-08 07:01:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-09-08 07:01:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-09-08 07:01:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:01:11,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:01:11,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:01:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:01:11,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:01:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:01:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:01:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:01:11,991 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:01:11,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:01:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-09-08 07:01:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-09-08 07:01:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-09-08 07:01:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-09-08 07:01:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-09-08 07:01:11,993 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-09-08 07:01:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-09-08 07:01:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-09-08 07:01:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:01:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-09-08 07:01:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-09-08 07:01:11,994 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-09-08 07:01:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-09-08 07:01:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-09-08 07:01:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:01:11,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:01:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:01:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:01:12,853 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:01:12,854 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:01:12,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:01:12 BoogieIcfgContainer [2019-09-08 07:01:12,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:01:12,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:01:12,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:01:12,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:01:12,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:01:11" (1/3) ... [2019-09-08 07:01:12,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f37a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:01:12, skipping insertion in model container [2019-09-08 07:01:12,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:01:11" (2/3) ... [2019-09-08 07:01:12,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f37a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:01:12, skipping insertion in model container [2019-09-08 07:01:12,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:01:12" (3/3) ... [2019-09-08 07:01:12,865 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2019-09-08 07:01:12,875 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:01:12,885 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:01:12,905 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:01:12,961 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:01:12,961 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:01:12,961 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:01:12,962 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:01:12,962 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:01:12,962 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:01:12,962 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:01:12,963 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:01:12,963 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:01:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states. [2019-09-08 07:01:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 07:01:12,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:13,000 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] [2019-09-08 07:01:13,003 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1350198626, now seen corresponding path program 1 times [2019-09-08 07:01:13,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:13,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:13,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:13,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:13,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 07:01:13,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:13,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:13,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:13,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:13,417 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 4 states. [2019-09-08 07:01:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:13,530 INFO L93 Difference]: Finished difference Result 449 states and 688 transitions. [2019-09-08 07:01:13,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:13,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-08 07:01:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:13,547 INFO L225 Difference]: With dead ends: 449 [2019-09-08 07:01:13,547 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 07:01:13,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 07:01:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-09-08 07:01:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-08 07:01:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2019-09-08 07:01:13,626 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 65 [2019-09-08 07:01:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:13,626 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2019-09-08 07:01:13,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2019-09-08 07:01:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 07:01:13,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:13,631 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] [2019-09-08 07:01:13,631 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash 752544265, now seen corresponding path program 1 times [2019-09-08 07:01:13,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:13,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:13,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:13,839 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 07:01:13,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:13,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:13,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:13,842 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 4 states. [2019-09-08 07:01:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:13,930 INFO L93 Difference]: Finished difference Result 440 states and 626 transitions. [2019-09-08 07:01:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:13,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-08 07:01:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:13,935 INFO L225 Difference]: With dead ends: 440 [2019-09-08 07:01:13,935 INFO L226 Difference]: Without dead ends: 233 [2019-09-08 07:01:13,937 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 07:01:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-08 07:01:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-09-08 07:01:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-08 07:01:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 322 transitions. [2019-09-08 07:01:13,963 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 322 transitions. Word has length 76 [2019-09-08 07:01:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:13,964 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-09-08 07:01:13,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 322 transitions. [2019-09-08 07:01:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:01:13,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:13,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:13,971 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:13,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1198234349, now seen corresponding path program 1 times [2019-09-08 07:01:13,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:13,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:13,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:13,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:14,162 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 07:01:14,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:14,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:01:14,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:01:14,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:01:14,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:14,166 INFO L87 Difference]: Start difference. First operand 233 states and 322 transitions. Second operand 7 states. [2019-09-08 07:01:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:15,460 INFO L93 Difference]: Finished difference Result 528 states and 731 transitions. [2019-09-08 07:01:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:01:15,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-09-08 07:01:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:15,468 INFO L225 Difference]: With dead ends: 528 [2019-09-08 07:01:15,468 INFO L226 Difference]: Without dead ends: 317 [2019-09-08 07:01:15,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:01:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-08 07:01:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2019-09-08 07:01:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 07:01:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 429 transitions. [2019-09-08 07:01:15,504 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 429 transitions. Word has length 94 [2019-09-08 07:01:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:15,505 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 429 transitions. [2019-09-08 07:01:15,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:01:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 429 transitions. [2019-09-08 07:01:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 07:01:15,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:15,508 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:15,508 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1956091229, now seen corresponding path program 1 times [2019-09-08 07:01:15,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:15,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:15,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:15,665 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 07:01:15,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:15,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:01:15,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:01:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:01:15,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:15,667 INFO L87 Difference]: Start difference. First operand 316 states and 429 transitions. Second operand 7 states. [2019-09-08 07:01:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:16,807 INFO L93 Difference]: Finished difference Result 534 states and 739 transitions. [2019-09-08 07:01:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:01:16,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 07:01:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:16,812 INFO L225 Difference]: With dead ends: 534 [2019-09-08 07:01:16,813 INFO L226 Difference]: Without dead ends: 320 [2019-09-08 07:01:16,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:01:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-08 07:01:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2019-09-08 07:01:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 07:01:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 429 transitions. [2019-09-08 07:01:16,839 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 429 transitions. Word has length 95 [2019-09-08 07:01:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:16,840 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 429 transitions. [2019-09-08 07:01:16,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:01:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 429 transitions. [2019-09-08 07:01:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 07:01:16,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:16,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:16,843 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:16,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:16,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2035733640, now seen corresponding path program 1 times [2019-09-08 07:01:16,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:16,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:16,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:16,939 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 07:01:16,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:16,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:01:16,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:01:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:01:16,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:16,941 INFO L87 Difference]: Start difference. First operand 316 states and 429 transitions. Second operand 7 states. [2019-09-08 07:01:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:18,069 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2019-09-08 07:01:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:01:18,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 07:01:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:18,073 INFO L225 Difference]: With dead ends: 535 [2019-09-08 07:01:18,073 INFO L226 Difference]: Without dead ends: 321 [2019-09-08 07:01:18,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:01:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-08 07:01:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2019-09-08 07:01:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-08 07:01:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 430 transitions. [2019-09-08 07:01:18,098 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 430 transitions. Word has length 97 [2019-09-08 07:01:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:18,099 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 430 transitions. [2019-09-08 07:01:18,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:01:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 430 transitions. [2019-09-08 07:01:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 07:01:18,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:18,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:18,101 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2085816559, now seen corresponding path program 1 times [2019-09-08 07:01:18,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:18,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:18,207 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 07:01:18,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:18,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:01:18,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:01:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:01:18,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:01:18,214 INFO L87 Difference]: Start difference. First operand 317 states and 430 transitions. Second operand 3 states. [2019-09-08 07:01:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:18,264 INFO L93 Difference]: Finished difference Result 767 states and 1066 transitions. [2019-09-08 07:01:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:01:18,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 07:01:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:18,269 INFO L225 Difference]: With dead ends: 767 [2019-09-08 07:01:18,270 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 07:01:18,271 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 07:01:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 07:01:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 534. [2019-09-08 07:01:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-09-08 07:01:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 738 transitions. [2019-09-08 07:01:18,321 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 738 transitions. Word has length 97 [2019-09-08 07:01:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:18,324 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 738 transitions. [2019-09-08 07:01:18,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:01:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 738 transitions. [2019-09-08 07:01:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 07:01:18,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:18,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:18,327 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1289417892, now seen corresponding path program 1 times [2019-09-08 07:01:18,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:18,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:18,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:18,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:18,432 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 07:01:18,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:18,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:01:18,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:01:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:01:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:01:18,434 INFO L87 Difference]: Start difference. First operand 534 states and 738 transitions. Second operand 3 states. [2019-09-08 07:01:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:18,501 INFO L93 Difference]: Finished difference Result 1270 states and 1800 transitions. [2019-09-08 07:01:18,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:01:18,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 07:01:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:18,510 INFO L225 Difference]: With dead ends: 1270 [2019-09-08 07:01:18,510 INFO L226 Difference]: Without dead ends: 881 [2019-09-08 07:01:18,513 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 07:01:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-08 07:01:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 833. [2019-09-08 07:01:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-08 07:01:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1177 transitions. [2019-09-08 07:01:18,585 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1177 transitions. Word has length 98 [2019-09-08 07:01:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:18,586 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1177 transitions. [2019-09-08 07:01:18,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:01:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1177 transitions. [2019-09-08 07:01:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 07:01:18,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:18,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:18,589 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1990482470, now seen corresponding path program 1 times [2019-09-08 07:01:18,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:18,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:18,701 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 07:01:18,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:18,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:18,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:18,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:18,703 INFO L87 Difference]: Start difference. First operand 833 states and 1177 transitions. Second operand 4 states. [2019-09-08 07:01:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:18,781 INFO L93 Difference]: Finished difference Result 1523 states and 2190 transitions. [2019-09-08 07:01:18,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:18,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-08 07:01:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:18,789 INFO L225 Difference]: With dead ends: 1523 [2019-09-08 07:01:18,789 INFO L226 Difference]: Without dead ends: 853 [2019-09-08 07:01:18,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 07:01:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-09-08 07:01:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2019-09-08 07:01:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-09-08 07:01:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1193 transitions. [2019-09-08 07:01:18,879 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1193 transitions. Word has length 98 [2019-09-08 07:01:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:18,879 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1193 transitions. [2019-09-08 07:01:18,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1193 transitions. [2019-09-08 07:01:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 07:01:18,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:18,883 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] [2019-09-08 07:01:18,883 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash -120269221, now seen corresponding path program 1 times [2019-09-08 07:01:18,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:18,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:18,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:18,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:18,953 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 07:01:18,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:18,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:01:18,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:01:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:01:18,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:01:18,955 INFO L87 Difference]: Start difference. First operand 853 states and 1193 transitions. Second operand 3 states. [2019-09-08 07:01:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:19,021 INFO L93 Difference]: Finished difference Result 1561 states and 2207 transitions. [2019-09-08 07:01:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:01:19,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 07:01:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:19,028 INFO L225 Difference]: With dead ends: 1561 [2019-09-08 07:01:19,028 INFO L226 Difference]: Without dead ends: 871 [2019-09-08 07:01:19,032 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 07:01:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-09-08 07:01:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 699. [2019-09-08 07:01:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-09-08 07:01:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 967 transitions. [2019-09-08 07:01:19,080 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 967 transitions. Word has length 107 [2019-09-08 07:01:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:19,083 INFO L475 AbstractCegarLoop]: Abstraction has 699 states and 967 transitions. [2019-09-08 07:01:19,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:01:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 967 transitions. [2019-09-08 07:01:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 07:01:19,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:19,091 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] [2019-09-08 07:01:19,091 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1065590776, now seen corresponding path program 1 times [2019-09-08 07:01:19,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:19,200 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 07:01:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:19,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:19,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:19,202 INFO L87 Difference]: Start difference. First operand 699 states and 967 transitions. Second operand 4 states. [2019-09-08 07:01:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:19,301 INFO L93 Difference]: Finished difference Result 1259 states and 1778 transitions. [2019-09-08 07:01:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:19,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-08 07:01:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:19,307 INFO L225 Difference]: With dead ends: 1259 [2019-09-08 07:01:19,308 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 07:01:19,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 07:01:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 07:01:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2019-09-08 07:01:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-08 07:01:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 979 transitions. [2019-09-08 07:01:19,366 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 979 transitions. Word has length 106 [2019-09-08 07:01:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:19,366 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 979 transitions. [2019-09-08 07:01:19,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 979 transitions. [2019-09-08 07:01:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 07:01:19,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:19,369 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:19,369 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:19,370 INFO L82 PathProgramCache]: Analyzing trace with hash -434369750, now seen corresponding path program 1 times [2019-09-08 07:01:19,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:19,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:19,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:01:19,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:19,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:01:19,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:01:19,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:01:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:01:19,457 INFO L87 Difference]: Start difference. First operand 714 states and 979 transitions. Second operand 3 states. [2019-09-08 07:01:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:19,538 INFO L93 Difference]: Finished difference Result 1481 states and 2055 transitions. [2019-09-08 07:01:19,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:01:19,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 07:01:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:19,548 INFO L225 Difference]: With dead ends: 1481 [2019-09-08 07:01:19,548 INFO L226 Difference]: Without dead ends: 921 [2019-09-08 07:01:19,551 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 07:01:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-08 07:01:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 714. [2019-09-08 07:01:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-08 07:01:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 977 transitions. [2019-09-08 07:01:19,605 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 977 transitions. Word has length 115 [2019-09-08 07:01:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:19,605 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 977 transitions. [2019-09-08 07:01:19,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:01:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 977 transitions. [2019-09-08 07:01:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 07:01:19,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:19,608 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:19,608 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:19,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1463435950, now seen corresponding path program 1 times [2019-09-08 07:01:19,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:19,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:01:19,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:19,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:19,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:19,686 INFO L87 Difference]: Start difference. First operand 714 states and 977 transitions. Second operand 4 states. [2019-09-08 07:01:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:19,758 INFO L93 Difference]: Finished difference Result 1286 states and 1785 transitions. [2019-09-08 07:01:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:19,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 07:01:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:19,765 INFO L225 Difference]: With dead ends: 1286 [2019-09-08 07:01:19,766 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 07:01:19,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 07:01:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-09-08 07:01:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-08 07:01:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 986 transitions. [2019-09-08 07:01:19,845 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 986 transitions. Word has length 114 [2019-09-08 07:01:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:19,845 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 986 transitions. [2019-09-08 07:01:19,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 986 transitions. [2019-09-08 07:01:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 07:01:19,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:19,848 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] [2019-09-08 07:01:19,848 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:19,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1101853038, now seen corresponding path program 1 times [2019-09-08 07:01:19,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:19,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:19,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:19,931 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 07:01:19,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:19,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:19,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:19,933 INFO L87 Difference]: Start difference. First operand 726 states and 986 transitions. Second operand 4 states. [2019-09-08 07:01:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:20,025 INFO L93 Difference]: Finished difference Result 1313 states and 1815 transitions. [2019-09-08 07:01:20,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:20,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 07:01:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:20,031 INFO L225 Difference]: With dead ends: 1313 [2019-09-08 07:01:20,032 INFO L226 Difference]: Without dead ends: 741 [2019-09-08 07:01:20,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 07:01:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-08 07:01:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2019-09-08 07:01:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-09-08 07:01:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 998 transitions. [2019-09-08 07:01:20,086 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 998 transitions. Word has length 114 [2019-09-08 07:01:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:20,086 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 998 transitions. [2019-09-08 07:01:20,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 998 transitions. [2019-09-08 07:01:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 07:01:20,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:20,089 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:20,089 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1849715534, now seen corresponding path program 1 times [2019-09-08 07:01:20,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:20,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 07:01:20,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:20,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:01:20,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:01:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:01:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:01:20,159 INFO L87 Difference]: Start difference. First operand 741 states and 998 transitions. Second operand 3 states. [2019-09-08 07:01:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:20,196 INFO L93 Difference]: Finished difference Result 1200 states and 1623 transitions. [2019-09-08 07:01:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:01:20,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 07:01:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:20,201 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 07:01:20,201 INFO L226 Difference]: Without dead ends: 560 [2019-09-08 07:01:20,204 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 07:01:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-08 07:01:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-09-08 07:01:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-09-08 07:01:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 751 transitions. [2019-09-08 07:01:20,236 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 751 transitions. Word has length 122 [2019-09-08 07:01:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:20,236 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 751 transitions. [2019-09-08 07:01:20,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:01:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 751 transitions. [2019-09-08 07:01:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 07:01:20,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:20,239 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:20,239 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash 960666090, now seen corresponding path program 1 times [2019-09-08 07:01:20,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:20,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 07:01:20,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:20,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:20,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:20,327 INFO L87 Difference]: Start difference. First operand 560 states and 751 transitions. Second operand 4 states. [2019-09-08 07:01:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:20,384 INFO L93 Difference]: Finished difference Result 993 states and 1349 transitions. [2019-09-08 07:01:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:20,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-08 07:01:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:20,389 INFO L225 Difference]: With dead ends: 993 [2019-09-08 07:01:20,389 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 07:01:20,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 07:01:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 07:01:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-09-08 07:01:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-08 07:01:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 761 transitions. [2019-09-08 07:01:20,427 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 761 transitions. Word has length 122 [2019-09-08 07:01:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:20,427 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 761 transitions. [2019-09-08 07:01:20,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 761 transitions. [2019-09-08 07:01:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 07:01:20,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:20,430 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:20,430 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 231374103, now seen corresponding path program 1 times [2019-09-08 07:01:20,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:20,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 07:01:20,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:20,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:01:20,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:01:20,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:01:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:01:20,668 INFO L87 Difference]: Start difference. First operand 572 states and 761 transitions. Second operand 10 states. [2019-09-08 07:01:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:23,365 INFO L93 Difference]: Finished difference Result 1426 states and 1886 transitions. [2019-09-08 07:01:23,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 07:01:23,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-09-08 07:01:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:23,373 INFO L225 Difference]: With dead ends: 1426 [2019-09-08 07:01:23,373 INFO L226 Difference]: Without dead ends: 983 [2019-09-08 07:01:23,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:01:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-09-08 07:01:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 929. [2019-09-08 07:01:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-08 07:01:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1212 transitions. [2019-09-08 07:01:23,427 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1212 transitions. Word has length 127 [2019-09-08 07:01:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:23,428 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1212 transitions. [2019-09-08 07:01:23,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:01:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1212 transitions. [2019-09-08 07:01:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 07:01:23,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:23,430 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:23,430 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:23,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1309367578, now seen corresponding path program 1 times [2019-09-08 07:01:23,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:23,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:23,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:23,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:23,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 07:01:23,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:23,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:23,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:23,511 INFO L87 Difference]: Start difference. First operand 929 states and 1212 transitions. Second operand 4 states. [2019-09-08 07:01:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:23,576 INFO L93 Difference]: Finished difference Result 1656 states and 2176 transitions. [2019-09-08 07:01:23,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:23,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 07:01:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:23,582 INFO L225 Difference]: With dead ends: 1656 [2019-09-08 07:01:23,582 INFO L226 Difference]: Without dead ends: 937 [2019-09-08 07:01:23,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-09-08 07:01:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 931. [2019-09-08 07:01:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-09-08 07:01:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1201 transitions. [2019-09-08 07:01:23,639 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1201 transitions. Word has length 129 [2019-09-08 07:01:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:23,639 INFO L475 AbstractCegarLoop]: Abstraction has 931 states and 1201 transitions. [2019-09-08 07:01:23,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1201 transitions. [2019-09-08 07:01:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 07:01:23,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:23,642 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:23,642 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1158758653, now seen corresponding path program 1 times [2019-09-08 07:01:23,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:23,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:23,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:23,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 07:01:23,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:23,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:01:23,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:01:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:01:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:23,806 INFO L87 Difference]: Start difference. First operand 931 states and 1201 transitions. Second operand 7 states. [2019-09-08 07:01:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:23,926 INFO L93 Difference]: Finished difference Result 986 states and 1278 transitions. [2019-09-08 07:01:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 07:01:23,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-09-08 07:01:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:23,934 INFO L225 Difference]: With dead ends: 986 [2019-09-08 07:01:23,934 INFO L226 Difference]: Without dead ends: 984 [2019-09-08 07:01:23,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:01:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-08 07:01:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 945. [2019-09-08 07:01:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-09-08 07:01:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1217 transitions. [2019-09-08 07:01:24,006 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1217 transitions. Word has length 130 [2019-09-08 07:01:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:24,007 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1217 transitions. [2019-09-08 07:01:24,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:01:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1217 transitions. [2019-09-08 07:01:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 07:01:24,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:24,011 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:24,011 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash 411270105, now seen corresponding path program 1 times [2019-09-08 07:01:24,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:24,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:24,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 07:01:24,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:24,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:01:24,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:01:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:01:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:01:24,208 INFO L87 Difference]: Start difference. First operand 945 states and 1217 transitions. Second operand 9 states. [2019-09-08 07:01:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:26,129 INFO L93 Difference]: Finished difference Result 1914 states and 2449 transitions. [2019-09-08 07:01:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:01:26,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 07:01:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:26,137 INFO L225 Difference]: With dead ends: 1914 [2019-09-08 07:01:26,137 INFO L226 Difference]: Without dead ends: 1213 [2019-09-08 07:01:26,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:01:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-08 07:01:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1025. [2019-09-08 07:01:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2019-09-08 07:01:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1303 transitions. [2019-09-08 07:01:26,202 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1303 transitions. Word has length 131 [2019-09-08 07:01:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:26,203 INFO L475 AbstractCegarLoop]: Abstraction has 1025 states and 1303 transitions. [2019-09-08 07:01:26,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:01:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1303 transitions. [2019-09-08 07:01:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 07:01:26,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:26,206 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:26,206 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1845562171, now seen corresponding path program 1 times [2019-09-08 07:01:26,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:26,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:26,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:26,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:26,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 07:01:26,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:26,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:01:26,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:01:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:01:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:01:26,414 INFO L87 Difference]: Start difference. First operand 1025 states and 1303 transitions. Second operand 10 states. [2019-09-08 07:01:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:30,127 INFO L93 Difference]: Finished difference Result 2574 states and 3259 transitions. [2019-09-08 07:01:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 07:01:30,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-09-08 07:01:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:30,138 INFO L225 Difference]: With dead ends: 2574 [2019-09-08 07:01:30,138 INFO L226 Difference]: Without dead ends: 1821 [2019-09-08 07:01:30,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:01:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2019-09-08 07:01:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1301. [2019-09-08 07:01:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-09-08 07:01:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1647 transitions. [2019-09-08 07:01:30,233 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1647 transitions. Word has length 135 [2019-09-08 07:01:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:30,233 INFO L475 AbstractCegarLoop]: Abstraction has 1301 states and 1647 transitions. [2019-09-08 07:01:30,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:01:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1647 transitions. [2019-09-08 07:01:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 07:01:30,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:30,236 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:30,237 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:30,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash -892660492, now seen corresponding path program 1 times [2019-09-08 07:01:30,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:30,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:30,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:30,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:30,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:30,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:30,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:01:30,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:01:30,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:01:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:30,316 INFO L87 Difference]: Start difference. First operand 1301 states and 1647 transitions. Second operand 5 states. [2019-09-08 07:01:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:30,783 INFO L93 Difference]: Finished difference Result 4295 states and 5485 transitions. [2019-09-08 07:01:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:01:30,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-08 07:01:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:30,805 INFO L225 Difference]: With dead ends: 4295 [2019-09-08 07:01:30,806 INFO L226 Difference]: Without dead ends: 3228 [2019-09-08 07:01:30,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2019-09-08 07:01:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2803. [2019-09-08 07:01:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2803 states. [2019-09-08 07:01:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 3562 transitions. [2019-09-08 07:01:31,000 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 3562 transitions. Word has length 136 [2019-09-08 07:01:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:31,001 INFO L475 AbstractCegarLoop]: Abstraction has 2803 states and 3562 transitions. [2019-09-08 07:01:31,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:01:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3562 transitions. [2019-09-08 07:01:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 07:01:31,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:31,004 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:31,004 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1842726510, now seen corresponding path program 1 times [2019-09-08 07:01:31,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:31,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:31,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:31,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 07:01:31,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:31,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:01:31,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:01:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:01:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:01:31,229 INFO L87 Difference]: Start difference. First operand 2803 states and 3562 transitions. Second operand 9 states. [2019-09-08 07:01:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:32,500 INFO L93 Difference]: Finished difference Result 4878 states and 6266 transitions. [2019-09-08 07:01:32,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:01:32,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-09-08 07:01:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:32,515 INFO L225 Difference]: With dead ends: 4878 [2019-09-08 07:01:32,515 INFO L226 Difference]: Without dead ends: 2481 [2019-09-08 07:01:32,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:01:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2019-09-08 07:01:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2171. [2019-09-08 07:01:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-09-08 07:01:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2745 transitions. [2019-09-08 07:01:32,676 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2745 transitions. Word has length 137 [2019-09-08 07:01:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:32,677 INFO L475 AbstractCegarLoop]: Abstraction has 2171 states and 2745 transitions. [2019-09-08 07:01:32,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:01:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2745 transitions. [2019-09-08 07:01:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 07:01:32,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:32,680 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:32,680 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:32,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1036705654, now seen corresponding path program 1 times [2019-09-08 07:01:32,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:32,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:32,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:32,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:32,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 07:01:32,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:32,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:01:32,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:01:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:01:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:01:32,827 INFO L87 Difference]: Start difference. First operand 2171 states and 2745 transitions. Second operand 9 states. [2019-09-08 07:01:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:34,738 INFO L93 Difference]: Finished difference Result 5611 states and 7265 transitions. [2019-09-08 07:01:34,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 07:01:34,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-09-08 07:01:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:34,761 INFO L225 Difference]: With dead ends: 5611 [2019-09-08 07:01:34,761 INFO L226 Difference]: Without dead ends: 3785 [2019-09-08 07:01:34,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:01:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2019-09-08 07:01:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3229. [2019-09-08 07:01:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2019-09-08 07:01:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4104 transitions. [2019-09-08 07:01:35,009 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4104 transitions. Word has length 138 [2019-09-08 07:01:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:35,010 INFO L475 AbstractCegarLoop]: Abstraction has 3229 states and 4104 transitions. [2019-09-08 07:01:35,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:01:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4104 transitions. [2019-09-08 07:01:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 07:01:35,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:35,013 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:35,014 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash -241325384, now seen corresponding path program 1 times [2019-09-08 07:01:35,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:35,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:35,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:35,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:35,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:35,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:01:35,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:01:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:01:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:35,105 INFO L87 Difference]: Start difference. First operand 3229 states and 4104 transitions. Second operand 5 states. [2019-09-08 07:01:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:36,083 INFO L93 Difference]: Finished difference Result 9823 states and 12596 transitions. [2019-09-08 07:01:36,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:01:36,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 07:01:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:36,144 INFO L225 Difference]: With dead ends: 9823 [2019-09-08 07:01:36,144 INFO L226 Difference]: Without dead ends: 7099 [2019-09-08 07:01:36,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7099 states. [2019-09-08 07:01:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7099 to 5035. [2019-09-08 07:01:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5035 states. [2019-09-08 07:01:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6393 transitions. [2019-09-08 07:01:36,694 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6393 transitions. Word has length 139 [2019-09-08 07:01:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:36,695 INFO L475 AbstractCegarLoop]: Abstraction has 5035 states and 6393 transitions. [2019-09-08 07:01:36,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:01:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6393 transitions. [2019-09-08 07:01:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 07:01:36,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:36,701 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:36,701 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1316344537, now seen corresponding path program 1 times [2019-09-08 07:01:36,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:36,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:36,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:36,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:36,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:36,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:36,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:01:36,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:01:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:01:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:36,826 INFO L87 Difference]: Start difference. First operand 5035 states and 6393 transitions. Second operand 5 states. [2019-09-08 07:01:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:37,560 INFO L93 Difference]: Finished difference Result 11563 states and 14724 transitions. [2019-09-08 07:01:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:01:37,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 07:01:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:37,592 INFO L225 Difference]: With dead ends: 11563 [2019-09-08 07:01:37,592 INFO L226 Difference]: Without dead ends: 7170 [2019-09-08 07:01:37,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-09-08 07:01:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6767. [2019-09-08 07:01:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6767 states. [2019-09-08 07:01:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6767 states to 6767 states and 8539 transitions. [2019-09-08 07:01:38,084 INFO L78 Accepts]: Start accepts. Automaton has 6767 states and 8539 transitions. Word has length 139 [2019-09-08 07:01:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:38,085 INFO L475 AbstractCegarLoop]: Abstraction has 6767 states and 8539 transitions. [2019-09-08 07:01:38,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:01:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6767 states and 8539 transitions. [2019-09-08 07:01:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 07:01:38,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:38,089 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:38,090 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:38,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1648537712, now seen corresponding path program 1 times [2019-09-08 07:01:38,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:38,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:38,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:38,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:38,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:38,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:38,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:01:38,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:01:38,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:01:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:01:38,152 INFO L87 Difference]: Start difference. First operand 6767 states and 8539 transitions. Second operand 3 states. [2019-09-08 07:01:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:38,710 INFO L93 Difference]: Finished difference Result 12983 states and 16437 transitions. [2019-09-08 07:01:38,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:01:38,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 07:01:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:38,747 INFO L225 Difference]: With dead ends: 12983 [2019-09-08 07:01:38,748 INFO L226 Difference]: Without dead ends: 6801 [2019-09-08 07:01:38,762 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 07:01:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6801 states. [2019-09-08 07:01:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6801 to 6769. [2019-09-08 07:01:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6769 states. [2019-09-08 07:01:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 8541 transitions. [2019-09-08 07:01:39,274 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 8541 transitions. Word has length 139 [2019-09-08 07:01:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:39,274 INFO L475 AbstractCegarLoop]: Abstraction has 6769 states and 8541 transitions. [2019-09-08 07:01:39,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:01:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 8541 transitions. [2019-09-08 07:01:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:01:39,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:39,279 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:39,279 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1452784867, now seen corresponding path program 1 times [2019-09-08 07:01:39,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:39,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:39,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:39,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:01:39,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:01:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:01:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:01:39,354 INFO L87 Difference]: Start difference. First operand 6769 states and 8541 transitions. Second operand 4 states. [2019-09-08 07:01:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:39,792 INFO L93 Difference]: Finished difference Result 13188 states and 16675 transitions. [2019-09-08 07:01:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:01:39,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 07:01:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:39,817 INFO L225 Difference]: With dead ends: 13188 [2019-09-08 07:01:39,817 INFO L226 Difference]: Without dead ends: 6783 [2019-09-08 07:01:39,834 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 07:01:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2019-09-08 07:01:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 6767. [2019-09-08 07:01:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6767 states. [2019-09-08 07:01:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6767 states to 6767 states and 8535 transitions. [2019-09-08 07:01:40,325 INFO L78 Accepts]: Start accepts. Automaton has 6767 states and 8535 transitions. Word has length 140 [2019-09-08 07:01:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:40,325 INFO L475 AbstractCegarLoop]: Abstraction has 6767 states and 8535 transitions. [2019-09-08 07:01:40,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:01:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6767 states and 8535 transitions. [2019-09-08 07:01:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:01:40,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:40,330 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:40,330 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash -774137477, now seen corresponding path program 1 times [2019-09-08 07:01:40,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:40,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:40,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:40,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:40,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:01:40,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:01:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:01:40,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:01:40,611 INFO L87 Difference]: Start difference. First operand 6767 states and 8535 transitions. Second operand 10 states. [2019-09-08 07:01:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:42,797 INFO L93 Difference]: Finished difference Result 13468 states and 17017 transitions. [2019-09-08 07:01:42,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 07:01:42,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 07:01:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:42,825 INFO L225 Difference]: With dead ends: 13468 [2019-09-08 07:01:42,826 INFO L226 Difference]: Without dead ends: 6861 [2019-09-08 07:01:42,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:01:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6861 states. [2019-09-08 07:01:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6861 to 6849. [2019-09-08 07:01:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6849 states. [2019-09-08 07:01:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6849 states to 6849 states and 8647 transitions. [2019-09-08 07:01:43,311 INFO L78 Accepts]: Start accepts. Automaton has 6849 states and 8647 transitions. Word has length 140 [2019-09-08 07:01:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:43,311 INFO L475 AbstractCegarLoop]: Abstraction has 6849 states and 8647 transitions. [2019-09-08 07:01:43,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:01:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6849 states and 8647 transitions. [2019-09-08 07:01:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:01:43,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:43,316 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:43,316 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:43,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:43,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1901854905, now seen corresponding path program 1 times [2019-09-08 07:01:43,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:43,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:43,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:43,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:43,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:43,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:43,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:01:43,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:01:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:01:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:01:43,561 INFO L87 Difference]: Start difference. First operand 6849 states and 8647 transitions. Second operand 10 states. [2019-09-08 07:01:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:46,211 INFO L93 Difference]: Finished difference Result 13751 states and 17409 transitions. [2019-09-08 07:01:46,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 07:01:46,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 07:01:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:46,248 INFO L225 Difference]: With dead ends: 13751 [2019-09-08 07:01:46,249 INFO L226 Difference]: Without dead ends: 7216 [2019-09-08 07:01:46,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:01:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7216 states. [2019-09-08 07:01:47,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7216 to 7145. [2019-09-08 07:01:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-09-08 07:01:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 9048 transitions. [2019-09-08 07:01:47,127 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 9048 transitions. Word has length 140 [2019-09-08 07:01:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:47,128 INFO L475 AbstractCegarLoop]: Abstraction has 7145 states and 9048 transitions. [2019-09-08 07:01:47,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:01:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 9048 transitions. [2019-09-08 07:01:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:01:47,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:47,133 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:47,134 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1554078729, now seen corresponding path program 1 times [2019-09-08 07:01:47,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:47,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:47,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:47,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:47,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:47,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:47,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:01:47,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:01:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:01:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:01:47,968 INFO L87 Difference]: Start difference. First operand 7145 states and 9048 transitions. Second operand 10 states. [2019-09-08 07:01:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:51,111 INFO L93 Difference]: Finished difference Result 13953 states and 17658 transitions. [2019-09-08 07:01:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 07:01:51,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 07:01:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:51,148 INFO L225 Difference]: With dead ends: 13953 [2019-09-08 07:01:51,149 INFO L226 Difference]: Without dead ends: 7165 [2019-09-08 07:01:51,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:01:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2019-09-08 07:01:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 7145. [2019-09-08 07:01:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-09-08 07:01:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 9042 transitions. [2019-09-08 07:01:52,278 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 9042 transitions. Word has length 140 [2019-09-08 07:01:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:52,279 INFO L475 AbstractCegarLoop]: Abstraction has 7145 states and 9042 transitions. [2019-09-08 07:01:52,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:01:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 9042 transitions. [2019-09-08 07:01:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:01:52,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:52,286 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:52,286 INFO L418 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 322984501, now seen corresponding path program 1 times [2019-09-08 07:01:52,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:52,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:52,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:52,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:01:52,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:01:52,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:01:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:01:52,702 INFO L87 Difference]: Start difference. First operand 7145 states and 9042 transitions. Second operand 10 states. [2019-09-08 07:01:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:55,051 INFO L93 Difference]: Finished difference Result 14007 states and 17699 transitions. [2019-09-08 07:01:55,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 07:01:55,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 07:01:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:55,083 INFO L225 Difference]: With dead ends: 14007 [2019-09-08 07:01:55,084 INFO L226 Difference]: Without dead ends: 7348 [2019-09-08 07:01:55,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:01:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7348 states. [2019-09-08 07:01:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7348 to 7205. [2019-09-08 07:01:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7205 states. [2019-09-08 07:01:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7205 states to 7205 states and 9117 transitions. [2019-09-08 07:01:55,891 INFO L78 Accepts]: Start accepts. Automaton has 7205 states and 9117 transitions. Word has length 140 [2019-09-08 07:01:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:55,892 INFO L475 AbstractCegarLoop]: Abstraction has 7205 states and 9117 transitions. [2019-09-08 07:01:55,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:01:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7205 states and 9117 transitions. [2019-09-08 07:01:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:01:55,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:55,896 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:55,897 INFO L418 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:55,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1210207347, now seen corresponding path program 1 times [2019-09-08 07:01:55,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:55,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:55,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:55,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:56,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:56,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:01:56,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:01:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:01:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:01:56,151 INFO L87 Difference]: Start difference. First operand 7205 states and 9117 transitions. Second operand 10 states. [2019-09-08 07:01:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:58,381 INFO L93 Difference]: Finished difference Result 14063 states and 17782 transitions. [2019-09-08 07:01:58,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 07:01:58,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 07:01:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:58,410 INFO L225 Difference]: With dead ends: 14063 [2019-09-08 07:01:58,410 INFO L226 Difference]: Without dead ends: 7237 [2019-09-08 07:01:58,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:01:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7237 states. [2019-09-08 07:01:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7237 to 7205. [2019-09-08 07:01:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7205 states. [2019-09-08 07:01:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7205 states to 7205 states and 9111 transitions. [2019-09-08 07:01:59,213 INFO L78 Accepts]: Start accepts. Automaton has 7205 states and 9111 transitions. Word has length 140 [2019-09-08 07:01:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:59,213 INFO L475 AbstractCegarLoop]: Abstraction has 7205 states and 9111 transitions. [2019-09-08 07:01:59,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:01:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7205 states and 9111 transitions. [2019-09-08 07:01:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:01:59,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:59,218 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:01:59,218 INFO L418 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1181707057, now seen corresponding path program 1 times [2019-09-08 07:01:59,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:59,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:59,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:01:59,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:59,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:01:59,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:01:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:01:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:59,398 INFO L87 Difference]: Start difference. First operand 7205 states and 9111 transitions. Second operand 7 states. [2019-09-08 07:02:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:00,934 INFO L93 Difference]: Finished difference Result 13841 states and 17455 transitions. [2019-09-08 07:02:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:02:00,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-08 07:02:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:00,961 INFO L225 Difference]: With dead ends: 13841 [2019-09-08 07:02:00,961 INFO L226 Difference]: Without dead ends: 6878 [2019-09-08 07:02:00,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:02:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2019-09-08 07:02:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 6771. [2019-09-08 07:02:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6771 states. [2019-09-08 07:02:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6771 states to 6771 states and 8539 transitions. [2019-09-08 07:02:01,770 INFO L78 Accepts]: Start accepts. Automaton has 6771 states and 8539 transitions. Word has length 140 [2019-09-08 07:02:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:01,771 INFO L475 AbstractCegarLoop]: Abstraction has 6771 states and 8539 transitions. [2019-09-08 07:02:01,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:02:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6771 states and 8539 transitions. [2019-09-08 07:02:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 07:02:01,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:01,777 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:01,777 INFO L418 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1812722051, now seen corresponding path program 1 times [2019-09-08 07:02:01,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:01,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:01,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:02:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:02:02,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:02:02,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:02:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:02:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:02:02,088 INFO L87 Difference]: Start difference. First operand 6771 states and 8539 transitions. Second operand 11 states. [2019-09-08 07:02:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:04,264 INFO L93 Difference]: Finished difference Result 12958 states and 16387 transitions. [2019-09-08 07:02:04,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 07:02:04,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-09-08 07:02:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:04,282 INFO L225 Difference]: With dead ends: 12958 [2019-09-08 07:02:04,282 INFO L226 Difference]: Without dead ends: 6552 [2019-09-08 07:02:04,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:02:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2019-09-08 07:02:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 6543. [2019-09-08 07:02:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6543 states. [2019-09-08 07:02:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 8262 transitions. [2019-09-08 07:02:04,841 INFO L78 Accepts]: Start accepts. Automaton has 6543 states and 8262 transitions. Word has length 140 [2019-09-08 07:02:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:04,841 INFO L475 AbstractCegarLoop]: Abstraction has 6543 states and 8262 transitions. [2019-09-08 07:02:04,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:02:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6543 states and 8262 transitions. [2019-09-08 07:02:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 07:02:04,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:04,843 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:04,843 INFO L418 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1405120895, now seen corresponding path program 1 times [2019-09-08 07:02:04,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:04,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:04,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:02:05,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:02:05,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:02:05,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:02:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:02:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:02:05,191 INFO L87 Difference]: Start difference. First operand 6543 states and 8262 transitions. Second operand 11 states. [2019-09-08 07:02:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:07,692 INFO L93 Difference]: Finished difference Result 12486 states and 15841 transitions. [2019-09-08 07:02:07,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 07:02:07,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 141 [2019-09-08 07:02:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:07,713 INFO L225 Difference]: With dead ends: 12486 [2019-09-08 07:02:07,713 INFO L226 Difference]: Without dead ends: 6357 [2019-09-08 07:02:07,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-09-08 07:02:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6357 states. [2019-09-08 07:02:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6357 to 6293. [2019-09-08 07:02:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6293 states. [2019-09-08 07:02:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6293 states to 6293 states and 7971 transitions. [2019-09-08 07:02:08,232 INFO L78 Accepts]: Start accepts. Automaton has 6293 states and 7971 transitions. Word has length 141 [2019-09-08 07:02:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:08,233 INFO L475 AbstractCegarLoop]: Abstraction has 6293 states and 7971 transitions. [2019-09-08 07:02:08,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:02:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6293 states and 7971 transitions. [2019-09-08 07:02:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 07:02:08,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:08,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:08,234 INFO L418 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash -237483594, now seen corresponding path program 1 times [2019-09-08 07:02:08,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:08,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:02:08,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:02:08,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 07:02:08,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 07:02:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 07:02:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:02:08,407 INFO L87 Difference]: Start difference. First operand 6293 states and 7971 transitions. Second operand 8 states. [2019-09-08 07:02:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:10,131 INFO L93 Difference]: Finished difference Result 12369 states and 15714 transitions. [2019-09-08 07:02:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:02:10,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2019-09-08 07:02:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:10,149 INFO L225 Difference]: With dead ends: 12369 [2019-09-08 07:02:10,150 INFO L226 Difference]: Without dead ends: 6343 [2019-09-08 07:02:10,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:02:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-09-08 07:02:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 6295. [2019-09-08 07:02:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6295 states. [2019-09-08 07:02:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 7967 transitions. [2019-09-08 07:02:10,737 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 7967 transitions. Word has length 142 [2019-09-08 07:02:10,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:10,738 INFO L475 AbstractCegarLoop]: Abstraction has 6295 states and 7967 transitions. [2019-09-08 07:02:10,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 07:02:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 7967 transitions. [2019-09-08 07:02:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 07:02:10,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:10,740 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:10,740 INFO L418 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:10,740 INFO L82 PathProgramCache]: Analyzing trace with hash -788047483, now seen corresponding path program 1 times [2019-09-08 07:02:10,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:10,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:10,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:10,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:10,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 07:02:10,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:02:10,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:02:10,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:02:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:02:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:02:10,801 INFO L87 Difference]: Start difference. First operand 6295 states and 7967 transitions. Second operand 4 states. [2019-09-08 07:02:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:11,362 INFO L93 Difference]: Finished difference Result 12284 states and 15604 transitions. [2019-09-08 07:02:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:02:11,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-08 07:02:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:11,375 INFO L225 Difference]: With dead ends: 12284 [2019-09-08 07:02:11,375 INFO L226 Difference]: Without dead ends: 6256 [2019-09-08 07:02:11,385 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 07:02:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2019-09-08 07:02:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6162. [2019-09-08 07:02:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6162 states. [2019-09-08 07:02:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6162 states to 6162 states and 7805 transitions. [2019-09-08 07:02:11,822 INFO L78 Accepts]: Start accepts. Automaton has 6162 states and 7805 transitions. Word has length 143 [2019-09-08 07:02:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:11,823 INFO L475 AbstractCegarLoop]: Abstraction has 6162 states and 7805 transitions. [2019-09-08 07:02:11,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:02:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 7805 transitions. [2019-09-08 07:02:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 07:02:11,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:11,830 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:11,830 INFO L418 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash -507785762, now seen corresponding path program 1 times [2019-09-08 07:02:11,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:11,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:11,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:11,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:11,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 07:02:12,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:02:12,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:02:12,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:12,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 1491 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:02:12,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:02:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 07:02:12,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:02:12,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 20 [2019-09-08 07:02:12,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 07:02:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 07:02:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:02:12,775 INFO L87 Difference]: Start difference. First operand 6162 states and 7805 transitions. Second operand 20 states. [2019-09-08 07:02:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:20,381 INFO L93 Difference]: Finished difference Result 13154 states and 16672 transitions. [2019-09-08 07:02:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-08 07:02:20,381 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 234 [2019-09-08 07:02:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:20,414 INFO L225 Difference]: With dead ends: 13154 [2019-09-08 07:02:20,414 INFO L226 Difference]: Without dead ends: 7136 [2019-09-08 07:02:20,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=962, Invalid=5358, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 07:02:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7136 states. [2019-09-08 07:02:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7136 to 6810. [2019-09-08 07:02:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6810 states. [2019-09-08 07:02:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6810 states to 6810 states and 8608 transitions. [2019-09-08 07:02:21,512 INFO L78 Accepts]: Start accepts. Automaton has 6810 states and 8608 transitions. Word has length 234 [2019-09-08 07:02:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:21,513 INFO L475 AbstractCegarLoop]: Abstraction has 6810 states and 8608 transitions. [2019-09-08 07:02:21,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 07:02:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6810 states and 8608 transitions. [2019-09-08 07:02:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 07:02:21,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:21,525 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:21,525 INFO L418 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:21,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:21,525 INFO L82 PathProgramCache]: Analyzing trace with hash 978645264, now seen corresponding path program 1 times [2019-09-08 07:02:21,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:21,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 07:02:21,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:02:21,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:02:21,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:21,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:02:21,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:02:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 07:02:22,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:02:22,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2019-09-08 07:02:22,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:02:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:02:22,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:02:22,071 INFO L87 Difference]: Start difference. First operand 6810 states and 8608 transitions. Second operand 11 states. [2019-09-08 07:02:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:24,150 INFO L93 Difference]: Finished difference Result 13490 states and 17088 transitions. [2019-09-08 07:02:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:02:24,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 235 [2019-09-08 07:02:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:24,179 INFO L225 Difference]: With dead ends: 13490 [2019-09-08 07:02:24,180 INFO L226 Difference]: Without dead ends: 6882 [2019-09-08 07:02:24,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:02:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2019-09-08 07:02:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6810. [2019-09-08 07:02:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6810 states. [2019-09-08 07:02:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6810 states to 6810 states and 8604 transitions. [2019-09-08 07:02:25,171 INFO L78 Accepts]: Start accepts. Automaton has 6810 states and 8604 transitions. Word has length 235 [2019-09-08 07:02:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:25,172 INFO L475 AbstractCegarLoop]: Abstraction has 6810 states and 8604 transitions. [2019-09-08 07:02:25,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:02:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6810 states and 8604 transitions. [2019-09-08 07:02:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 07:02:25,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:25,179 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:25,180 INFO L418 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1323473426, now seen corresponding path program 1 times [2019-09-08 07:02:25,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:25,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:25,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:25,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 07:02:25,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:02:25,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:02:25,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:25,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1491 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 07:02:25,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:02:25,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:02:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 07:02:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:02:25,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2019-09-08 07:02:25,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 07:02:25,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 07:02:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:02:25,959 INFO L87 Difference]: Start difference. First operand 6810 states and 8604 transitions. Second operand 16 states. [2019-09-08 07:02:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:37,681 INFO L93 Difference]: Finished difference Result 24503 states and 31507 transitions. [2019-09-08 07:02:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 07:02:37,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 235 [2019-09-08 07:02:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:37,760 INFO L225 Difference]: With dead ends: 24503 [2019-09-08 07:02:37,760 INFO L226 Difference]: Without dead ends: 17837 [2019-09-08 07:02:37,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1127, Invalid=7063, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 07:02:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17837 states. [2019-09-08 07:02:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17837 to 13798. [2019-09-08 07:02:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13798 states. [2019-09-08 07:02:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17769 transitions. [2019-09-08 07:02:40,082 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17769 transitions. Word has length 235 [2019-09-08 07:02:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:40,082 INFO L475 AbstractCegarLoop]: Abstraction has 13798 states and 17769 transitions. [2019-09-08 07:02:40,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 07:02:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17769 transitions. [2019-09-08 07:02:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 07:02:40,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:40,094 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:40,095 INFO L418 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:40,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1322992616, now seen corresponding path program 1 times [2019-09-08 07:02:40,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:40,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:40,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:40,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:40,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 07:02:40,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:02:40,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:02:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:40,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 07:02:40,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:02:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:02:40,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:02:40,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2019-09-08 07:02:40,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 07:02:40,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 07:02:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:02:40,879 INFO L87 Difference]: Start difference. First operand 13798 states and 17769 transitions. Second operand 19 states. [2019-09-08 07:02:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:48,972 INFO L93 Difference]: Finished difference Result 27755 states and 35784 transitions. [2019-09-08 07:02:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 07:02:48,973 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 236 [2019-09-08 07:02:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:49,026 INFO L225 Difference]: With dead ends: 27755 [2019-09-08 07:02:49,027 INFO L226 Difference]: Without dead ends: 14315 [2019-09-08 07:02:49,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=956, Invalid=3874, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 07:02:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14315 states. [2019-09-08 07:02:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14315 to 14145. [2019-09-08 07:02:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14145 states. [2019-09-08 07:02:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 18211 transitions. [2019-09-08 07:02:50,744 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 18211 transitions. Word has length 236 [2019-09-08 07:02:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:50,744 INFO L475 AbstractCegarLoop]: Abstraction has 14145 states and 18211 transitions. [2019-09-08 07:02:50,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 07:02:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 18211 transitions. [2019-09-08 07:02:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 07:02:50,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:50,755 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:02:50,756 INFO L418 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash 989251706, now seen corresponding path program 1 times [2019-09-08 07:02:50,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:50,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:50,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 07:02:51,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:02:51,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:02:51,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:51,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 07:02:51,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:02:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 07:02:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:02:51,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2019-09-08 07:02:51,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 07:02:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 07:02:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:02:51,596 INFO L87 Difference]: Start difference. First operand 14145 states and 18211 transitions. Second operand 20 states. [2019-09-08 07:03:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:01,395 INFO L93 Difference]: Finished difference Result 30503 states and 39317 transitions. [2019-09-08 07:03:01,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-08 07:03:01,395 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 244 [2019-09-08 07:03:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:01,437 INFO L225 Difference]: With dead ends: 30503 [2019-09-08 07:03:01,438 INFO L226 Difference]: Without dead ends: 16716 [2019-09-08 07:03:01,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=617, Invalid=5545, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 07:03:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16716 states. [2019-09-08 07:03:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16716 to 15234. [2019-09-08 07:03:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15234 states. [2019-09-08 07:03:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15234 states to 15234 states and 19593 transitions. [2019-09-08 07:03:03,813 INFO L78 Accepts]: Start accepts. Automaton has 15234 states and 19593 transitions. Word has length 244 [2019-09-08 07:03:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:03:03,813 INFO L475 AbstractCegarLoop]: Abstraction has 15234 states and 19593 transitions. [2019-09-08 07:03:03,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 07:03:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15234 states and 19593 transitions. [2019-09-08 07:03:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 07:03:03,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:03:03,823 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:03:03,823 INFO L418 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:03:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:03:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1680324224, now seen corresponding path program 1 times [2019-09-08 07:03:03,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:03:03,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:03:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:03,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 07:03:04,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:03:04,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:03:04,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:04,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 07:03:04,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:03:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:03:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 07:03:04,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:03:04,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 19 [2019-09-08 07:03:04,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 07:03:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 07:03:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:03:04,429 INFO L87 Difference]: Start difference. First operand 15234 states and 19593 transitions. Second operand 19 states. [2019-09-08 07:03:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:12,600 INFO L93 Difference]: Finished difference Result 33842 states and 43637 transitions. [2019-09-08 07:03:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 07:03:12,601 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 251 [2019-09-08 07:03:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:12,658 INFO L225 Difference]: With dead ends: 33842 [2019-09-08 07:03:12,659 INFO L226 Difference]: Without dead ends: 19008 [2019-09-08 07:03:12,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=429, Invalid=1923, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 07:03:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19008 states. [2019-09-08 07:03:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19008 to 18053. [2019-09-08 07:03:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18053 states. [2019-09-08 07:03:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18053 states to 18053 states and 23213 transitions. [2019-09-08 07:03:14,396 INFO L78 Accepts]: Start accepts. Automaton has 18053 states and 23213 transitions. Word has length 251 [2019-09-08 07:03:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:03:14,397 INFO L475 AbstractCegarLoop]: Abstraction has 18053 states and 23213 transitions. [2019-09-08 07:03:14,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 07:03:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 18053 states and 23213 transitions. [2019-09-08 07:03:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 07:03:14,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:03:14,412 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:03:14,413 INFO L418 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:03:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:03:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1402881924, now seen corresponding path program 1 times [2019-09-08 07:03:14,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:03:14,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:03:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:14,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 07:03:14,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:03:14,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:03:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:15,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1548 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:03:15,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:03:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:03:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 07:03:15,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:03:15,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2019-09-08 07:03:15,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 07:03:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 07:03:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:03:15,158 INFO L87 Difference]: Start difference. First operand 18053 states and 23213 transitions. Second operand 17 states. [2019-09-08 07:03:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:21,788 INFO L93 Difference]: Finished difference Result 48366 states and 62307 transitions. [2019-09-08 07:03:21,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 07:03:21,789 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 251 [2019-09-08 07:03:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:21,906 INFO L225 Difference]: With dead ends: 48366 [2019-09-08 07:03:21,906 INFO L226 Difference]: Without dead ends: 30447 [2019-09-08 07:03:21,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=1392, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 07:03:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30447 states. [2019-09-08 07:03:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30447 to 29541. [2019-09-08 07:03:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29541 states. [2019-09-08 07:03:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29541 states to 29541 states and 38057 transitions. [2019-09-08 07:03:25,794 INFO L78 Accepts]: Start accepts. Automaton has 29541 states and 38057 transitions. Word has length 251 [2019-09-08 07:03:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:03:25,794 INFO L475 AbstractCegarLoop]: Abstraction has 29541 states and 38057 transitions. [2019-09-08 07:03:25,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 07:03:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 29541 states and 38057 transitions. [2019-09-08 07:03:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 07:03:25,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:03:25,817 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:03:25,817 INFO L418 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:03:25,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:03:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash -558457915, now seen corresponding path program 1 times [2019-09-08 07:03:25,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:03:25,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:03:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:25,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 07:03:26,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:03:26,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:03:26,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:03:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:26,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1557 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 07:03:26,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:03:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 07:03:26,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:03:26,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-09-08 07:03:26,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 07:03:26,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 07:03:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:03:26,520 INFO L87 Difference]: Start difference. First operand 29541 states and 38057 transitions. Second operand 17 states. [2019-09-08 07:03:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:38,119 INFO L93 Difference]: Finished difference Result 74863 states and 99664 transitions. [2019-09-08 07:03:38,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 07:03:38,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 254 [2019-09-08 07:03:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:38,226 INFO L225 Difference]: With dead ends: 74863 [2019-09-08 07:03:38,226 INFO L226 Difference]: Without dead ends: 45792 [2019-09-08 07:03:38,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=574, Invalid=2848, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 07:03:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45792 states. [2019-09-08 07:03:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45792 to 37180. [2019-09-08 07:03:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37180 states. [2019-09-08 07:03:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37180 states to 37180 states and 48106 transitions. [2019-09-08 07:03:43,227 INFO L78 Accepts]: Start accepts. Automaton has 37180 states and 48106 transitions. Word has length 254 [2019-09-08 07:03:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:03:43,227 INFO L475 AbstractCegarLoop]: Abstraction has 37180 states and 48106 transitions. [2019-09-08 07:03:43,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 07:03:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37180 states and 48106 transitions. [2019-09-08 07:03:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 07:03:43,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:03:43,245 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:03:43,246 INFO L418 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:03:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:03:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2078545056, now seen corresponding path program 1 times [2019-09-08 07:03:43,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:03:43,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:03:43,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:43,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:43,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 07:03:43,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:03:43,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:03:43,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:03:43,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:03:43,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:03:43,379 INFO L87 Difference]: Start difference. First operand 37180 states and 48106 transitions. Second operand 9 states. [2019-09-08 07:03:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:50,965 INFO L93 Difference]: Finished difference Result 114051 states and 149606 transitions. [2019-09-08 07:03:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 07:03:50,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 252 [2019-09-08 07:03:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:51,202 INFO L225 Difference]: With dead ends: 114051 [2019-09-08 07:03:51,202 INFO L226 Difference]: Without dead ends: 77756 [2019-09-08 07:03:51,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:03:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77756 states. [2019-09-08 07:04:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77756 to 72480. [2019-09-08 07:04:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72480 states. [2019-09-08 07:04:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72480 states to 72480 states and 95108 transitions. [2019-09-08 07:04:00,213 INFO L78 Accepts]: Start accepts. Automaton has 72480 states and 95108 transitions. Word has length 252 [2019-09-08 07:04:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:04:00,214 INFO L475 AbstractCegarLoop]: Abstraction has 72480 states and 95108 transitions. [2019-09-08 07:04:00,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:04:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 72480 states and 95108 transitions. [2019-09-08 07:04:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 07:04:00,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:04:00,238 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:04:00,238 INFO L418 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:04:00,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:04:00,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1206100645, now seen corresponding path program 1 times [2019-09-08 07:04:00,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:04:00,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:04:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 07:04:00,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:04:00,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:04:00,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:04:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:00,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1533 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 07:04:00,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:04:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 07:04:00,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:04:00,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2019-09-08 07:04:00,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 07:04:00,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 07:04:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:04:00,946 INFO L87 Difference]: Start difference. First operand 72480 states and 95108 transitions. Second operand 19 states. [2019-09-08 07:04:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:04:15,450 INFO L93 Difference]: Finished difference Result 145226 states and 190957 transitions. [2019-09-08 07:04:15,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 07:04:15,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 254 [2019-09-08 07:04:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:04:15,684 INFO L225 Difference]: With dead ends: 145226 [2019-09-08 07:04:15,684 INFO L226 Difference]: Without dead ends: 73535 [2019-09-08 07:04:15,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=846, Invalid=3984, Unknown=0, NotChecked=0, Total=4830 [2019-09-08 07:04:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73535 states. [2019-09-08 07:04:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73535 to 72689. [2019-09-08 07:04:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72689 states. [2019-09-08 07:04:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72689 states to 72689 states and 95565 transitions. [2019-09-08 07:04:26,644 INFO L78 Accepts]: Start accepts. Automaton has 72689 states and 95565 transitions. Word has length 254 [2019-09-08 07:04:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:04:26,644 INFO L475 AbstractCegarLoop]: Abstraction has 72689 states and 95565 transitions. [2019-09-08 07:04:26,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 07:04:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 72689 states and 95565 transitions. [2019-09-08 07:04:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 07:04:26,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:04:26,674 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:04:26,675 INFO L418 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:04:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:04:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2046771550, now seen corresponding path program 1 times [2019-09-08 07:04:26,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:04:26,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:04:26,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:26,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:26,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 07:04:26,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:04:26,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:04:26,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:27,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-08 07:04:27,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:04:27,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:04:27,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:04:27,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:04:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 88 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 07:04:28,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:04:28,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2019-09-08 07:04:28,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-08 07:04:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-08 07:04:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 07:04:28,078 INFO L87 Difference]: Start difference. First operand 72689 states and 95565 transitions. Second operand 34 states. [2019-09-08 07:04:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:04:47,098 INFO L93 Difference]: Finished difference Result 145048 states and 190786 transitions. [2019-09-08 07:04:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-08 07:04:47,099 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 262 [2019-09-08 07:04:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:04:47,280 INFO L225 Difference]: With dead ends: 145048 [2019-09-08 07:04:47,281 INFO L226 Difference]: Without dead ends: 73220 [2019-09-08 07:04:47,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 266 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1643, Invalid=8457, Unknown=0, NotChecked=0, Total=10100 [2019-09-08 07:04:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73220 states. [2019-09-08 07:04:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73220 to 72779. [2019-09-08 07:04:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72779 states. [2019-09-08 07:04:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72779 states to 72779 states and 95668 transitions. [2019-09-08 07:04:57,947 INFO L78 Accepts]: Start accepts. Automaton has 72779 states and 95668 transitions. Word has length 262 [2019-09-08 07:04:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:04:57,947 INFO L475 AbstractCegarLoop]: Abstraction has 72779 states and 95668 transitions. [2019-09-08 07:04:57,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-08 07:04:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 72779 states and 95668 transitions. [2019-09-08 07:04:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 07:04:57,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:04:57,980 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:04:57,980 INFO L418 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:04:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:04:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 721474908, now seen corresponding path program 1 times [2019-09-08 07:04:57,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:04:57,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:04:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 07:04:58,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:04:58,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:04:58,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:58,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 07:04:58,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:04:58,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:04:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 07:04:58,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:04:58,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2019-09-08 07:04:58,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 07:04:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 07:04:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-09-08 07:04:58,862 INFO L87 Difference]: Start difference. First operand 72779 states and 95668 transitions. Second operand 19 states. [2019-09-08 07:05:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:09,596 INFO L93 Difference]: Finished difference Result 131399 states and 173197 transitions. [2019-09-08 07:05:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 07:05:09,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 262 [2019-09-08 07:05:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:09,783 INFO L225 Difference]: With dead ends: 131399 [2019-09-08 07:05:09,783 INFO L226 Difference]: Without dead ends: 59202 [2019-09-08 07:05:09,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=749, Invalid=2791, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 07:05:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59202 states. [2019-09-08 07:05:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59202 to 57203. [2019-09-08 07:05:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57203 states. [2019-09-08 07:05:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57203 states to 57203 states and 74777 transitions. [2019-09-08 07:05:16,778 INFO L78 Accepts]: Start accepts. Automaton has 57203 states and 74777 transitions. Word has length 262 [2019-09-08 07:05:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:16,779 INFO L475 AbstractCegarLoop]: Abstraction has 57203 states and 74777 transitions. [2019-09-08 07:05:16,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 07:05:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 57203 states and 74777 transitions. [2019-09-08 07:05:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 07:05:16,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:16,794 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:16,794 INFO L418 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:16,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash 114422818, now seen corresponding path program 1 times [2019-09-08 07:05:16,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:16,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:16,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:16,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:16,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-08 07:05:16,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:16,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:17,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:17,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 07:05:17,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 20 proven. 127 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 07:05:17,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:17,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-09-08 07:05:17,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 07:05:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 07:05:17,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:05:17,518 INFO L87 Difference]: Start difference. First operand 57203 states and 74777 transitions. Second operand 17 states. [2019-09-08 07:05:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:29,979 INFO L93 Difference]: Finished difference Result 139953 states and 182456 transitions. [2019-09-08 07:05:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 07:05:29,980 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 265 [2019-09-08 07:05:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:30,204 INFO L225 Difference]: With dead ends: 139953 [2019-09-08 07:05:30,204 INFO L226 Difference]: Without dead ends: 83255 [2019-09-08 07:05:30,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 07:05:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83255 states. [2019-09-08 07:05:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83255 to 72387. [2019-09-08 07:05:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72387 states. [2019-09-08 07:05:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72387 states to 72387 states and 92677 transitions. [2019-09-08 07:05:38,317 INFO L78 Accepts]: Start accepts. Automaton has 72387 states and 92677 transitions. Word has length 265 [2019-09-08 07:05:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:38,317 INFO L475 AbstractCegarLoop]: Abstraction has 72387 states and 92677 transitions. [2019-09-08 07:05:38,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 07:05:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 72387 states and 92677 transitions. [2019-09-08 07:05:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 07:05:38,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:38,330 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:05:38,330 INFO L418 AbstractCegarLoop]: === Iteration 51 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:38,331 INFO L82 PathProgramCache]: Analyzing trace with hash -22677144, now seen corresponding path program 1 times [2019-09-08 07:05:38,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:38,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-08 07:05:38,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:38,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:38,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:38,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:05:38,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 95 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 07:05:39,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:05:39,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2019-09-08 07:05:39,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 07:05:39,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 07:05:39,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:05:39,158 INFO L87 Difference]: Start difference. First operand 72387 states and 92677 transitions. Second operand 24 states. [2019-09-08 07:06:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:04,947 INFO L93 Difference]: Finished difference Result 175796 states and 226951 transitions. [2019-09-08 07:06:04,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 07:06:04,947 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 264 [2019-09-08 07:06:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:05,251 INFO L225 Difference]: With dead ends: 175796 [2019-09-08 07:06:05,252 INFO L226 Difference]: Without dead ends: 111606 [2019-09-08 07:06:05,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10319 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3054, Invalid=25676, Unknown=0, NotChecked=0, Total=28730 [2019-09-08 07:06:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111606 states. [2019-09-08 07:06:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111606 to 105836. [2019-09-08 07:06:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105836 states. [2019-09-08 07:06:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105836 states to 105836 states and 135975 transitions. [2019-09-08 07:06:20,460 INFO L78 Accepts]: Start accepts. Automaton has 105836 states and 135975 transitions. Word has length 264 [2019-09-08 07:06:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:20,460 INFO L475 AbstractCegarLoop]: Abstraction has 105836 states and 135975 transitions. [2019-09-08 07:06:20,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 07:06:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 105836 states and 135975 transitions. [2019-09-08 07:06:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 07:06:20,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:20,487 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:06:20,488 INFO L418 AbstractCegarLoop]: === Iteration 52 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1763015068, now seen corresponding path program 1 times [2019-09-08 07:06:20,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:20,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:20,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:20,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-08 07:06:20,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:20,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:20,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:21,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1549 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 07:06:21,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:21,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:06:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 07:06:21,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:21,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-08 07:06:21,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:06:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:06:21,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:06:21,203 INFO L87 Difference]: Start difference. First operand 105836 states and 135975 transitions. Second operand 14 states. [2019-09-08 07:06:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:32,266 INFO L93 Difference]: Finished difference Result 199207 states and 256365 transitions. [2019-09-08 07:06:32,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 07:06:32,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 264 [2019-09-08 07:06:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:32,501 INFO L225 Difference]: With dead ends: 199207 [2019-09-08 07:06:32,502 INFO L226 Difference]: Without dead ends: 96722 [2019-09-08 07:06:32,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:06:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96722 states. [2019-09-08 07:06:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96722 to 96499. [2019-09-08 07:06:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96499 states. [2019-09-08 07:06:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96499 states to 96499 states and 123356 transitions. [2019-09-08 07:06:46,477 INFO L78 Accepts]: Start accepts. Automaton has 96499 states and 123356 transitions. Word has length 264 [2019-09-08 07:06:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:46,477 INFO L475 AbstractCegarLoop]: Abstraction has 96499 states and 123356 transitions. [2019-09-08 07:06:46,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:06:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 96499 states and 123356 transitions. [2019-09-08 07:06:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 07:06:46,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:46,497 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:06:46,497 INFO L418 AbstractCegarLoop]: === Iteration 53 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 958658063, now seen corresponding path program 1 times [2019-09-08 07:06:46,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:46,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-08 07:06:46,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:46,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:06:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:47,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 07:06:47,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:47,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 07:06:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 07:06:47,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:47,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2019-09-08 07:06:47,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:06:47,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:06:47,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:06:47,075 INFO L87 Difference]: Start difference. First operand 96499 states and 123356 transitions. Second operand 13 states. [2019-09-08 07:06:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:58,129 INFO L93 Difference]: Finished difference Result 172583 states and 221623 transitions. [2019-09-08 07:06:58,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 07:06:58,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2019-09-08 07:06:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:58,327 INFO L225 Difference]: With dead ends: 172583 [2019-09-08 07:06:58,328 INFO L226 Difference]: Without dead ends: 81420 [2019-09-08 07:06:58,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-09-08 07:06:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81420 states. [2019-09-08 07:07:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81420 to 74437. [2019-09-08 07:07:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74437 states. [2019-09-08 07:07:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74437 states to 74437 states and 94936 transitions. [2019-09-08 07:07:10,045 INFO L78 Accepts]: Start accepts. Automaton has 74437 states and 94936 transitions. Word has length 265 [2019-09-08 07:07:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:10,046 INFO L475 AbstractCegarLoop]: Abstraction has 74437 states and 94936 transitions. [2019-09-08 07:07:10,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:07:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 74437 states and 94936 transitions. [2019-09-08 07:07:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 07:07:10,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:10,060 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:10,060 INFO L418 AbstractCegarLoop]: === Iteration 54 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1374594808, now seen corresponding path program 1 times [2019-09-08 07:07:10,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:10,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:10,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:10,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:10,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 07:07:10,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:10,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:07:10,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:10,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 1592 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 07:07:10,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 07:07:10,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:10,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2019-09-08 07:07:10,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 07:07:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 07:07:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:07:10,783 INFO L87 Difference]: Start difference. First operand 74437 states and 94936 transitions. Second operand 20 states. [2019-09-08 07:07:12,193 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-08 07:07:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:07:27,361 INFO L93 Difference]: Finished difference Result 149373 states and 190480 transitions. [2019-09-08 07:07:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 07:07:27,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 268 [2019-09-08 07:07:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:07:27,552 INFO L225 Difference]: With dead ends: 149373 [2019-09-08 07:07:27,553 INFO L226 Difference]: Without dead ends: 75729 [2019-09-08 07:07:27,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2762 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=864, Invalid=8066, Unknown=0, NotChecked=0, Total=8930 [2019-09-08 07:07:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75729 states. [2019-09-08 07:07:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75729 to 74873. [2019-09-08 07:07:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74873 states. [2019-09-08 07:07:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74873 states to 74873 states and 95424 transitions. [2019-09-08 07:07:36,800 INFO L78 Accepts]: Start accepts. Automaton has 74873 states and 95424 transitions. Word has length 268 [2019-09-08 07:07:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:36,800 INFO L475 AbstractCegarLoop]: Abstraction has 74873 states and 95424 transitions. [2019-09-08 07:07:36,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 07:07:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 74873 states and 95424 transitions. [2019-09-08 07:07:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 07:07:36,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:36,813 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:36,813 INFO L418 AbstractCegarLoop]: === Iteration 55 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash -988394893, now seen corresponding path program 1 times [2019-09-08 07:07:36,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:36,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:36,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-08 07:07:37,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:37,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:37,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:37,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1573 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 07:07:37,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 70 proven. 72 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 07:07:37,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:07:37,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 20 [2019-09-08 07:07:37,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 07:07:37,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 07:07:37,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:07:37,747 INFO L87 Difference]: Start difference. First operand 74873 states and 95424 transitions. Second operand 20 states. [2019-09-08 07:08:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:00,985 INFO L93 Difference]: Finished difference Result 171630 states and 224759 transitions. [2019-09-08 07:08:00,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 07:08:00,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 273 [2019-09-08 07:08:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:01,296 INFO L225 Difference]: With dead ends: 171630 [2019-09-08 07:08:01,296 INFO L226 Difference]: Without dead ends: 111162 [2019-09-08 07:08:01,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=766, Invalid=5554, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 07:08:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111162 states. [2019-09-08 07:08:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111162 to 88893. [2019-09-08 07:08:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88893 states. [2019-09-08 07:08:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88893 states to 88893 states and 111633 transitions. [2019-09-08 07:08:12,471 INFO L78 Accepts]: Start accepts. Automaton has 88893 states and 111633 transitions. Word has length 273 [2019-09-08 07:08:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:12,471 INFO L475 AbstractCegarLoop]: Abstraction has 88893 states and 111633 transitions. [2019-09-08 07:08:12,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 07:08:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 88893 states and 111633 transitions. [2019-09-08 07:08:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 07:08:12,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:12,484 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:12,484 INFO L418 AbstractCegarLoop]: === Iteration 56 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash -402083224, now seen corresponding path program 1 times [2019-09-08 07:08:12,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:12,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:12,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-08 07:08:13,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:08:13,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:08:13,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:08:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:08:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:08:13,130 INFO L87 Difference]: Start difference. First operand 88893 states and 111633 transitions. Second operand 9 states. [2019-09-08 07:08:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:25,327 INFO L93 Difference]: Finished difference Result 159277 states and 201860 transitions. [2019-09-08 07:08:25,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 07:08:25,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 273 [2019-09-08 07:08:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:25,528 INFO L225 Difference]: With dead ends: 159277 [2019-09-08 07:08:25,528 INFO L226 Difference]: Without dead ends: 85754 [2019-09-08 07:08:25,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:08:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85754 states. [2019-09-08 07:08:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85754 to 84326. [2019-09-08 07:08:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84326 states. [2019-09-08 07:08:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84326 states to 84326 states and 105557 transitions. [2019-09-08 07:08:34,993 INFO L78 Accepts]: Start accepts. Automaton has 84326 states and 105557 transitions. Word has length 273 [2019-09-08 07:08:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:08:34,993 INFO L475 AbstractCegarLoop]: Abstraction has 84326 states and 105557 transitions. [2019-09-08 07:08:34,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:08:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 84326 states and 105557 transitions. [2019-09-08 07:08:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-08 07:08:35,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:08:35,007 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:08:35,007 INFO L418 AbstractCegarLoop]: === Iteration 57 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:08:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:08:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1510618362, now seen corresponding path program 1 times [2019-09-08 07:08:35,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:08:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:08:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:35,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:08:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-08 07:08:35,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:08:35,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:08:35,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:08:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:08:35,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 07:08:35,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:08:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 115 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 07:08:35,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:08:35,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-09-08 07:08:35,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 07:08:35,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 07:08:35,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-09-08 07:08:35,816 INFO L87 Difference]: Start difference. First operand 84326 states and 105557 transitions. Second operand 20 states. [2019-09-08 07:08:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:08:49,655 INFO L93 Difference]: Finished difference Result 154424 states and 194762 transitions. [2019-09-08 07:08:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 07:08:49,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 274 [2019-09-08 07:08:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:08:49,839 INFO L225 Difference]: With dead ends: 154424 [2019-09-08 07:08:49,839 INFO L226 Difference]: Without dead ends: 82990 [2019-09-08 07:08:49,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 07:08:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82990 states. [2019-09-08 07:09:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82990 to 81895. [2019-09-08 07:09:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81895 states. [2019-09-08 07:09:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81895 states to 81895 states and 102663 transitions. [2019-09-08 07:09:02,691 INFO L78 Accepts]: Start accepts. Automaton has 81895 states and 102663 transitions. Word has length 274 [2019-09-08 07:09:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:02,691 INFO L475 AbstractCegarLoop]: Abstraction has 81895 states and 102663 transitions. [2019-09-08 07:09:02,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 07:09:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 81895 states and 102663 transitions. [2019-09-08 07:09:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-08 07:09:02,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:02,704 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:09:02,704 INFO L418 AbstractCegarLoop]: === Iteration 58 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash -502466233, now seen corresponding path program 1 times [2019-09-08 07:09:02,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:02,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:02,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:02,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:02,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 07:09:02,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:09:02,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:09:02,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:09:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:09:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:09:02,810 INFO L87 Difference]: Start difference. First operand 81895 states and 102663 transitions. Second operand 5 states. [2019-09-08 07:09:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:14,838 INFO L93 Difference]: Finished difference Result 188437 states and 238464 transitions. [2019-09-08 07:09:14,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:09:14,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 275 [2019-09-08 07:09:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:15,137 INFO L225 Difference]: With dead ends: 188437 [2019-09-08 07:09:15,137 INFO L226 Difference]: Without dead ends: 119327 [2019-09-08 07:09:15,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:09:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119327 states. [2019-09-08 07:09:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119327 to 102233. [2019-09-08 07:09:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102233 states. [2019-09-08 07:09:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102233 states to 102233 states and 128450 transitions. [2019-09-08 07:09:27,378 INFO L78 Accepts]: Start accepts. Automaton has 102233 states and 128450 transitions. Word has length 275 [2019-09-08 07:09:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:09:27,378 INFO L475 AbstractCegarLoop]: Abstraction has 102233 states and 128450 transitions. [2019-09-08 07:09:27,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:09:27,378 INFO L276 IsEmpty]: Start isEmpty. Operand 102233 states and 128450 transitions. [2019-09-08 07:09:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 07:09:27,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:09:27,395 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:09:27,395 INFO L418 AbstractCegarLoop]: === Iteration 59 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:09:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:09:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash 115490798, now seen corresponding path program 1 times [2019-09-08 07:09:27,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:09:27,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:09:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:27,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:09:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:09:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 07:09:27,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:09:27,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:09:27,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:09:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:09:28,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 07:09:28,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:09:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 85 proven. 45 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 07:09:28,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:09:28,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2019-09-08 07:09:28,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 07:09:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 07:09:28,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-09-08 07:09:28,741 INFO L87 Difference]: Start difference. First operand 102233 states and 128450 transitions. Second operand 27 states. [2019-09-08 07:09:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:09:48,484 INFO L93 Difference]: Finished difference Result 198558 states and 250053 transitions. [2019-09-08 07:09:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 07:09:48,484 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 276 [2019-09-08 07:09:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:09:48,757 INFO L225 Difference]: With dead ends: 198558 [2019-09-08 07:09:48,757 INFO L226 Difference]: Without dead ends: 105287 [2019-09-08 07:09:48,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1470 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1091, Invalid=4165, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 07:09:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105287 states. [2019-09-08 07:10:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105287 to 101763. [2019-09-08 07:10:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101763 states. [2019-09-08 07:10:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101763 states to 101763 states and 127805 transitions. [2019-09-08 07:10:01,058 INFO L78 Accepts]: Start accepts. Automaton has 101763 states and 127805 transitions. Word has length 276 [2019-09-08 07:10:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:10:01,058 INFO L475 AbstractCegarLoop]: Abstraction has 101763 states and 127805 transitions. [2019-09-08 07:10:01,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 07:10:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 101763 states and 127805 transitions. [2019-09-08 07:10:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 07:10:01,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:10:01,076 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:10:01,076 INFO L418 AbstractCegarLoop]: === Iteration 60 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:10:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:10:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1337804656, now seen corresponding path program 1 times [2019-09-08 07:10:01,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:10:01,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:10:01,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:01,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:10:01,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:10:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-08 07:10:01,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:10:01,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:10:01,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:10:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:10:01,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 07:10:01,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:10:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 56 proven. 74 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 07:10:02,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:10:02,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-09-08 07:10:02,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 07:10:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 07:10:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 07:10:02,019 INFO L87 Difference]: Start difference. First operand 101763 states and 127805 transitions. Second operand 29 states. [2019-09-08 07:11:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:11:58,002 INFO L93 Difference]: Finished difference Result 772222 states and 975349 transitions. [2019-09-08 07:11:58,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 290 states. [2019-09-08 07:11:58,003 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 279 [2019-09-08 07:11:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:11:59,846 INFO L225 Difference]: With dead ends: 772222 [2019-09-08 07:11:59,846 INFO L226 Difference]: Without dead ends: 675722 [2019-09-08 07:12:00,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41099 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=8872, Invalid=90668, Unknown=0, NotChecked=0, Total=99540 [2019-09-08 07:12:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675722 states.