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/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:55,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:55,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:55,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:55,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:55,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:55,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:55,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:55,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:55,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:55,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:55,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:55,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:55,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:55,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:55,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:55,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:55,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:55,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:55,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:55,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:55,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:55,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:55,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:55,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:55,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:55,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:55,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:55,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:55,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:55,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:55,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:55,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:55,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:55,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:55,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:55,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:55,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:55,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:55,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:55,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:55,565 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-10-13 19:50:55,593 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:55,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:55,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:55,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:55,597 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:55,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:55,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:55,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:55,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:55,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:55,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:55,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:55,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:55,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:55,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:55,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:55,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:55,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:55,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:55,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:55,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:55,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:55,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:55,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:55,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:55,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:55,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:55,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:55,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:55,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:55,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:55,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:55,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:55,909 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:55,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-10-13 19:50:55,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1484c91e4/4364d26743a041a9a785e4cbe629c1f8/FLAG7ce427a61 [2019-10-13 19:50:56,519 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:56,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-10-13 19:50:56,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1484c91e4/4364d26743a041a9a785e4cbe629c1f8/FLAG7ce427a61 [2019-10-13 19:50:56,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1484c91e4/4364d26743a041a9a785e4cbe629c1f8 [2019-10-13 19:50:56,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:56,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:56,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:56,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:56,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:56,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:56" (1/1) ... [2019-10-13 19:50:56,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb457ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:56, skipping insertion in model container [2019-10-13 19:50:56,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:56" (1/1) ... [2019-10-13 19:50:56,858 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:56,895 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:57,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:57,085 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:57,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:57,246 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:57,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57 WrapperNode [2019-10-13 19:50:57,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:57,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:57,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:57,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:57,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (1/1) ... [2019-10-13 19:50:57,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (1/1) ... [2019-10-13 19:50:57,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (1/1) ... [2019-10-13 19:50:57,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (1/1) ... [2019-10-13 19:50:57,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (1/1) ... [2019-10-13 19:50:57,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (1/1) ... [2019-10-13 19:50:57,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (1/1) ... [2019-10-13 19:50:57,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:57,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:57,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:57,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:57,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (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-10-13 19:50:57,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:57,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:57,349 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:50:57,349 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-10-13 19:50:57,349 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-13 19:50:57,350 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-13 19:50:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-13 19:50:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-13 19:50:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-13 19:50:57,352 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 19:50:57,352 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:50:57,353 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:50:57,353 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 19:50:57,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 19:50:57,355 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 19:50:57,356 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:50:57,356 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:50:57,357 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:50:57,357 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:50:57,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:57,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 19:50:57,358 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 19:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 19:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 19:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:50:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:57,916 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:57,917 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 19:50:57,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:57 BoogieIcfgContainer [2019-10-13 19:50:57,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:57,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:57,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:57,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:57,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:56" (1/3) ... [2019-10-13 19:50:57,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c9762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:57, skipping insertion in model container [2019-10-13 19:50:57,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:57" (2/3) ... [2019-10-13 19:50:57,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c9762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:57, skipping insertion in model container [2019-10-13 19:50:57,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:57" (3/3) ... [2019-10-13 19:50:57,931 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-10-13 19:50:57,942 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:57,964 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:57,974 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:58,006 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:58,006 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:58,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:58,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:58,007 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:58,007 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:58,007 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:58,007 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-10-13 19:50:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:50:58,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,042 INFO L380 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] [2019-10-13 19:50:58,044 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash 4101629, now seen corresponding path program 1 times [2019-10-13 19:50:58,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594837308] [2019-10-13 19:50:58,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:58,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594837308] [2019-10-13 19:50:58,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:50:58,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844723589] [2019-10-13 19:50:58,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:50:58,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:50:58,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:50:58,723 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 10 states. [2019-10-13 19:51:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,284 INFO L93 Difference]: Finished difference Result 545 states and 904 transitions. [2019-10-13 19:51:01,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 19:51:01,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-13 19:51:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,308 INFO L225 Difference]: With dead ends: 545 [2019-10-13 19:51:01,308 INFO L226 Difference]: Without dead ends: 410 [2019-10-13 19:51:01,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:51:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-13 19:51:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 233. [2019-10-13 19:51:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-13 19:51:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2019-10-13 19:51:01,530 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2019-10-13 19:51:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,531 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2019-10-13 19:51:01,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2019-10-13 19:51:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:51:01,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,540 INFO L380 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] [2019-10-13 19:51:01,541 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1430979773, now seen corresponding path program 1 times [2019-10-13 19:51:01,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403379230] [2019-10-13 19:51:01,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:01,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403379230] [2019-10-13 19:51:01,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:01,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678657522] [2019-10-13 19:51:01,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:01,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:01,800 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 10 states. [2019-10-13 19:51:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,693 INFO L93 Difference]: Finished difference Result 798 states and 1152 transitions. [2019-10-13 19:51:04,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 19:51:04,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-13 19:51:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,700 INFO L225 Difference]: With dead ends: 798 [2019-10-13 19:51:04,700 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 19:51:04,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2019-10-13 19:51:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 19:51:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 359. [2019-10-13 19:51:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-13 19:51:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2019-10-13 19:51:04,761 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2019-10-13 19:51:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,762 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2019-10-13 19:51:04,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2019-10-13 19:51:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:51:04,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,766 INFO L380 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] [2019-10-13 19:51:04,766 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1477202113, now seen corresponding path program 1 times [2019-10-13 19:51:04,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563957124] [2019-10-13 19:51:04,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:05,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563957124] [2019-10-13 19:51:05,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:05,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 19:51:05,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471130876] [2019-10-13 19:51:05,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:51:05,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:51:05,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:51:05,008 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 11 states. [2019-10-13 19:51:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:06,729 INFO L93 Difference]: Finished difference Result 854 states and 1203 transitions. [2019-10-13 19:51:06,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:06,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-10-13 19:51:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:06,735 INFO L225 Difference]: With dead ends: 854 [2019-10-13 19:51:06,735 INFO L226 Difference]: Without dead ends: 538 [2019-10-13 19:51:06,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:51:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-13 19:51:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 364. [2019-10-13 19:51:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-10-13 19:51:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2019-10-13 19:51:06,790 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2019-10-13 19:51:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,791 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2019-10-13 19:51:06,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:51:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2019-10-13 19:51:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:51:06,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,794 INFO L380 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] [2019-10-13 19:51:06,794 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1229055619, now seen corresponding path program 1 times [2019-10-13 19:51:06,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24913723] [2019-10-13 19:51:06,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:06,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24913723] [2019-10-13 19:51:06,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:06,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:06,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519086720] [2019-10-13 19:51:06,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:06,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:06,984 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 10 states. [2019-10-13 19:51:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:09,753 INFO L93 Difference]: Finished difference Result 1293 states and 1852 transitions. [2019-10-13 19:51:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 19:51:09,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-13 19:51:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:09,763 INFO L225 Difference]: With dead ends: 1293 [2019-10-13 19:51:09,763 INFO L226 Difference]: Without dead ends: 972 [2019-10-13 19:51:09,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:51:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-10-13 19:51:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 693. [2019-10-13 19:51:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-10-13 19:51:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 897 transitions. [2019-10-13 19:51:09,851 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 897 transitions. Word has length 78 [2019-10-13 19:51:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:09,852 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 897 transitions. [2019-10-13 19:51:09,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 897 transitions. [2019-10-13 19:51:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:51:09,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:09,854 INFO L380 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] [2019-10-13 19:51:09,854 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 650743635, now seen corresponding path program 1 times [2019-10-13 19:51:09,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:09,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302680322] [2019-10-13 19:51:09,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:09,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:09,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:10,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302680322] [2019-10-13 19:51:10,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:10,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 19:51:10,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051498384] [2019-10-13 19:51:10,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:51:10,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:51:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:51:10,117 INFO L87 Difference]: Start difference. First operand 693 states and 897 transitions. Second operand 11 states. [2019-10-13 19:51:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:12,007 INFO L93 Difference]: Finished difference Result 1615 states and 2204 transitions. [2019-10-13 19:51:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 19:51:12,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-10-13 19:51:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:12,015 INFO L225 Difference]: With dead ends: 1615 [2019-10-13 19:51:12,015 INFO L226 Difference]: Without dead ends: 965 [2019-10-13 19:51:12,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:51:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-10-13 19:51:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 708. [2019-10-13 19:51:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-10-13 19:51:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 909 transitions. [2019-10-13 19:51:12,101 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 909 transitions. Word has length 78 [2019-10-13 19:51:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:12,101 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 909 transitions. [2019-10-13 19:51:12,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:51:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 909 transitions. [2019-10-13 19:51:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:51:12,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:12,105 INFO L380 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] [2019-10-13 19:51:12,105 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash 578357077, now seen corresponding path program 1 times [2019-10-13 19:51:12,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:12,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312316461] [2019-10-13 19:51:12,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:12,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312316461] [2019-10-13 19:51:12,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:12,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:12,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334504153] [2019-10-13 19:51:12,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:12,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:12,324 INFO L87 Difference]: Start difference. First operand 708 states and 909 transitions. Second operand 10 states. [2019-10-13 19:51:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:15,138 INFO L93 Difference]: Finished difference Result 1671 states and 2254 transitions. [2019-10-13 19:51:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 19:51:15,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-13 19:51:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:15,150 INFO L225 Difference]: With dead ends: 1671 [2019-10-13 19:51:15,150 INFO L226 Difference]: Without dead ends: 1105 [2019-10-13 19:51:15,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2019-10-13 19:51:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-10-13 19:51:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 724. [2019-10-13 19:51:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-13 19:51:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 918 transitions. [2019-10-13 19:51:15,228 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 918 transitions. Word has length 78 [2019-10-13 19:51:15,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:15,228 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 918 transitions. [2019-10-13 19:51:15,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 918 transitions. [2019-10-13 19:51:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:51:15,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:15,231 INFO L380 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] [2019-10-13 19:51:15,232 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:15,232 INFO L82 PathProgramCache]: Analyzing trace with hash 68883987, now seen corresponding path program 1 times [2019-10-13 19:51:15,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:15,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707992095] [2019-10-13 19:51:15,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:15,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707992095] [2019-10-13 19:51:15,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:15,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:51:15,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456342139] [2019-10-13 19:51:15,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:51:15,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:15,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:51:15,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:51:15,422 INFO L87 Difference]: Start difference. First operand 724 states and 918 transitions. Second operand 8 states. [2019-10-13 19:51:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:17,776 INFO L93 Difference]: Finished difference Result 2460 states and 3468 transitions. [2019-10-13 19:51:17,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 19:51:17,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-10-13 19:51:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:17,793 INFO L225 Difference]: With dead ends: 2460 [2019-10-13 19:51:17,793 INFO L226 Difference]: Without dead ends: 1807 [2019-10-13 19:51:17,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:51:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2019-10-13 19:51:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1392. [2019-10-13 19:51:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-10-13 19:51:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1789 transitions. [2019-10-13 19:51:17,937 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1789 transitions. Word has length 78 [2019-10-13 19:51:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:17,937 INFO L462 AbstractCegarLoop]: Abstraction has 1392 states and 1789 transitions. [2019-10-13 19:51:17,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:51:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1789 transitions. [2019-10-13 19:51:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 19:51:17,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:17,940 INFO L380 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] [2019-10-13 19:51:17,941 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 173246819, now seen corresponding path program 1 times [2019-10-13 19:51:17,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:17,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133747751] [2019-10-13 19:51:17,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:17,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:17,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:18,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133747751] [2019-10-13 19:51:18,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:18,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:51:18,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814582835] [2019-10-13 19:51:18,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:51:18,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:51:18,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:51:18,189 INFO L87 Difference]: Start difference. First operand 1392 states and 1789 transitions. Second operand 8 states. [2019-10-13 19:51:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:20,063 INFO L93 Difference]: Finished difference Result 4302 states and 5953 transitions. [2019-10-13 19:51:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 19:51:20,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-10-13 19:51:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:20,082 INFO L225 Difference]: With dead ends: 4302 [2019-10-13 19:51:20,083 INFO L226 Difference]: Without dead ends: 2927 [2019-10-13 19:51:20,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:51:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2019-10-13 19:51:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2582. [2019-10-13 19:51:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2019-10-13 19:51:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3439 transitions. [2019-10-13 19:51:20,423 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3439 transitions. Word has length 79 [2019-10-13 19:51:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:20,424 INFO L462 AbstractCegarLoop]: Abstraction has 2582 states and 3439 transitions. [2019-10-13 19:51:20,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:51:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3439 transitions. [2019-10-13 19:51:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 19:51:20,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:20,427 INFO L380 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] [2019-10-13 19:51:20,428 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:20,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1970791480, now seen corresponding path program 1 times [2019-10-13 19:51:20,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:20,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514964059] [2019-10-13 19:51:20,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:20,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:20,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:20,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514964059] [2019-10-13 19:51:20,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:20,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 19:51:20,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451552899] [2019-10-13 19:51:20,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:51:20,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:20,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:51:20,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:51:20,654 INFO L87 Difference]: Start difference. First operand 2582 states and 3439 transitions. Second operand 11 states. [2019-10-13 19:51:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:24,457 INFO L93 Difference]: Finished difference Result 8214 states and 11790 transitions. [2019-10-13 19:51:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 19:51:24,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-10-13 19:51:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:24,494 INFO L225 Difference]: With dead ends: 8214 [2019-10-13 19:51:24,495 INFO L226 Difference]: Without dead ends: 5722 [2019-10-13 19:51:24,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 19:51:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5722 states. [2019-10-13 19:51:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5722 to 5206. [2019-10-13 19:51:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5206 states. [2019-10-13 19:51:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 7174 transitions. [2019-10-13 19:51:25,241 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 7174 transitions. Word has length 87 [2019-10-13 19:51:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:25,243 INFO L462 AbstractCegarLoop]: Abstraction has 5206 states and 7174 transitions. [2019-10-13 19:51:25,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:51:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 7174 transitions. [2019-10-13 19:51:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 19:51:25,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:25,246 INFO L380 BasicCegarLoop]: trace histogram [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-10-13 19:51:25,246 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1829324777, now seen corresponding path program 1 times [2019-10-13 19:51:25,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:25,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761057202] [2019-10-13 19:51:25,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:25,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761057202] [2019-10-13 19:51:25,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:25,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:25,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989539984] [2019-10-13 19:51:25,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:25,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:25,505 INFO L87 Difference]: Start difference. First operand 5206 states and 7174 transitions. Second operand 10 states. [2019-10-13 19:51:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:28,099 INFO L93 Difference]: Finished difference Result 7331 states and 10016 transitions. [2019-10-13 19:51:28,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 19:51:28,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-10-13 19:51:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:28,141 INFO L225 Difference]: With dead ends: 7331 [2019-10-13 19:51:28,142 INFO L226 Difference]: Without dead ends: 7328 [2019-10-13 19:51:28,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2019-10-13 19:51:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-10-13 19:51:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 6697. [2019-10-13 19:51:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6697 states. [2019-10-13 19:51:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6697 states to 6697 states and 9164 transitions. [2019-10-13 19:51:29,021 INFO L78 Accepts]: Start accepts. Automaton has 6697 states and 9164 transitions. Word has length 88 [2019-10-13 19:51:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:29,022 INFO L462 AbstractCegarLoop]: Abstraction has 6697 states and 9164 transitions. [2019-10-13 19:51:29,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6697 states and 9164 transitions. [2019-10-13 19:51:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:51:29,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:29,027 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:51:29,027 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash -797912562, now seen corresponding path program 1 times [2019-10-13 19:51:29,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:29,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486416269] [2019-10-13 19:51:29,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:29,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:29,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:51:29,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486416269] [2019-10-13 19:51:29,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:29,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:29,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788059430] [2019-10-13 19:51:29,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:29,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:29,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:29,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:29,206 INFO L87 Difference]: Start difference. First operand 6697 states and 9164 transitions. Second operand 10 states. [2019-10-13 19:51:30,021 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-10-13 19:51:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:31,351 INFO L93 Difference]: Finished difference Result 13461 states and 18395 transitions. [2019-10-13 19:51:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 19:51:31,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-10-13 19:51:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:31,387 INFO L225 Difference]: With dead ends: 13461 [2019-10-13 19:51:31,387 INFO L226 Difference]: Without dead ends: 6821 [2019-10-13 19:51:31,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:51:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states.