/usr/bin/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/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:24:04,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:24:04,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:24:04,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:24:04,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:24:04,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:24:04,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:24:04,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:24:04,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:24:04,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:24:04,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:24:04,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:24:04,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:24:04,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:24:04,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:24:04,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:24:04,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:24:04,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:24:04,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:24:04,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:24:04,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:24:04,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:24:04,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:24:04,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:24:04,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:24:04,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:24:04,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:24:04,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:24:04,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:24:04,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:24:04,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:24:04,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:24:04,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:24:04,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:24:04,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:24:04,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:24:04,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:24:04,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:24:04,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:24:04,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:24:04,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:24:04,776 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-11-06 22:24:04,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:24:04,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:24:04,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:24:04,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:24:04,817 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:24:04,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:24:04,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:24:04,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:24:04,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:24:04,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:24:04,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:24:04,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:24:04,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:24:04,820 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:24:04,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:24:04,822 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:24:04,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:24:04,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:24:04,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:24:04,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:24:04,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:24:04,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:04,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:24:04,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:24:04,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:24:04,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:24:04,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:24:04,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:24:04,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:24:05,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:24:05,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:24:05,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:24:05,132 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:24:05,132 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:24:05,133 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-11-06 22:24:05,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014619fa2/138ad6a111db42b7a8b0805ba9ad686d/FLAG8f4faa33d [2019-11-06 22:24:05,734 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:24:05,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-11-06 22:24:05,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014619fa2/138ad6a111db42b7a8b0805ba9ad686d/FLAG8f4faa33d [2019-11-06 22:24:06,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014619fa2/138ad6a111db42b7a8b0805ba9ad686d [2019-11-06 22:24:06,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:24:06,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:24:06,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:06,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:24:06,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:24:06,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d11077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06, skipping insertion in model container [2019-11-06 22:24:06,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:24:06,186 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:24:06,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:06,472 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:24:06,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:06,645 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:24:06,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06 WrapperNode [2019-11-06 22:24:06,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:06,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:24:06,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:24:06,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:24:06,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (1/1) ... [2019-11-06 22:24:06,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:24:06,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:24:06,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:24:06,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:24:06,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (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-11-06 22:24:06,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:24:06,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-06 22:24:06,757 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-11-06 22:24:06,758 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-11-06 22:24:06,758 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-06 22:24:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-06 22:24:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-06 22:24:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:24:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-06 22:24:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-06 22:24:06,760 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-06 22:24:06,760 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-06 22:24:06,760 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-06 22:24:06,760 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-06 22:24:06,760 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-06 22:24:06,760 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-06 22:24:06,760 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:24:06,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:24:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:24:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:24:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-06 22:24:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-06 22:24:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-11-06 22:24:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-11-06 22:24:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-06 22:24:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:24:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-06 22:24:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-06 22:24:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-11-06 22:24:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-11-06 22:24:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-06 22:24:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-06 22:24:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-06 22:24:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:24:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-06 22:24:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-06 22:24:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-06 22:24:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-06 22:24:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-06 22:24:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-06 22:24:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-06 22:24:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:24:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:24:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:24:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:24:07,483 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:24:07,483 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-06 22:24:07,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:07 BoogieIcfgContainer [2019-11-06 22:24:07,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:24:07,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:24:07,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:24:07,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:24:07,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:06" (1/3) ... [2019-11-06 22:24:07,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3b5d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:07, skipping insertion in model container [2019-11-06 22:24:07,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:06" (2/3) ... [2019-11-06 22:24:07,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3b5d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:07, skipping insertion in model container [2019-11-06 22:24:07,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:07" (3/3) ... [2019-11-06 22:24:07,505 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-11-06 22:24:07,517 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:24:07,539 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:24:07,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:24:07,579 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:24:07,579 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:24:07,580 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:24:07,580 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:24:07,580 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:24:07,580 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:24:07,580 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:24:07,581 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:24:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-11-06 22:24:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:07,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:07,619 INFO L410 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-11-06 22:24:07,621 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash -604727244, now seen corresponding path program 1 times [2019-11-06 22:24:07,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:07,634 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545666459] [2019-11-06 22:24:07,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:08,313 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545666459] [2019-11-06 22:24:08,314 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:08,314 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:24:08,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126796722] [2019-11-06 22:24:08,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:24:08,321 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:08,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:24:08,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:08,338 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 9 states. [2019-11-06 22:24:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:12,014 INFO L93 Difference]: Finished difference Result 778 states and 1234 transitions. [2019-11-06 22:24:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:12,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-11-06 22:24:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:12,038 INFO L225 Difference]: With dead ends: 778 [2019-11-06 22:24:12,039 INFO L226 Difference]: Without dead ends: 569 [2019-11-06 22:24:12,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:24:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-11-06 22:24:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379. [2019-11-06 22:24:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-06 22:24:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 534 transitions. [2019-11-06 22:24:12,185 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 534 transitions. Word has length 106 [2019-11-06 22:24:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:12,186 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 534 transitions. [2019-11-06 22:24:12,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:24:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 534 transitions. [2019-11-06 22:24:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:12,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:12,200 INFO L410 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-11-06 22:24:12,200 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 994888564, now seen corresponding path program 1 times [2019-11-06 22:24:12,201 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:12,201 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427872945] [2019-11-06 22:24:12,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:12,539 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427872945] [2019-11-06 22:24:12,539 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:12,540 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:12,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037027699] [2019-11-06 22:24:12,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:12,542 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:12,543 INFO L87 Difference]: Start difference. First operand 379 states and 534 transitions. Second operand 10 states. [2019-11-06 22:24:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:14,357 INFO L93 Difference]: Finished difference Result 917 states and 1348 transitions. [2019-11-06 22:24:14,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:14,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:14,363 INFO L225 Difference]: With dead ends: 917 [2019-11-06 22:24:14,364 INFO L226 Difference]: Without dead ends: 559 [2019-11-06 22:24:14,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-11-06 22:24:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 379. [2019-11-06 22:24:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-06 22:24:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 527 transitions. [2019-11-06 22:24:14,419 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 527 transitions. Word has length 106 [2019-11-06 22:24:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:14,419 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 527 transitions. [2019-11-06 22:24:14,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 527 transitions. [2019-11-06 22:24:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:14,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:14,421 INFO L410 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-11-06 22:24:14,422 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:14,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1031720908, now seen corresponding path program 1 times [2019-11-06 22:24:14,422 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:14,423 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199348386] [2019-11-06 22:24:14,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:14,629 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199348386] [2019-11-06 22:24:14,629 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:14,629 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:14,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346024651] [2019-11-06 22:24:14,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:14,630 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:14,631 INFO L87 Difference]: Start difference. First operand 379 states and 527 transitions. Second operand 10 states. [2019-11-06 22:24:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:16,540 INFO L93 Difference]: Finished difference Result 913 states and 1326 transitions. [2019-11-06 22:24:16,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:16,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:16,551 INFO L225 Difference]: With dead ends: 913 [2019-11-06 22:24:16,551 INFO L226 Difference]: Without dead ends: 555 [2019-11-06 22:24:16,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-06 22:24:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 379. [2019-11-06 22:24:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-11-06 22:24:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2019-11-06 22:24:16,658 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 106 [2019-11-06 22:24:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:16,658 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2019-11-06 22:24:16,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:16,658 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2019-11-06 22:24:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:16,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:16,660 INFO L410 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-11-06 22:24:16,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2066926732, now seen corresponding path program 1 times [2019-11-06 22:24:16,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:16,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734662603] [2019-11-06 22:24:16,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:16,880 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734662603] [2019-11-06 22:24:16,881 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:16,881 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:16,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175814666] [2019-11-06 22:24:16,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:16,883 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:16,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:16,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:16,884 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand 10 states. [2019-11-06 22:24:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:19,471 INFO L93 Difference]: Finished difference Result 1100 states and 1650 transitions. [2019-11-06 22:24:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:19,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:19,479 INFO L225 Difference]: With dead ends: 1100 [2019-11-06 22:24:19,479 INFO L226 Difference]: Without dead ends: 742 [2019-11-06 22:24:19,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-11-06 22:24:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 471. [2019-11-06 22:24:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-06 22:24:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 625 transitions. [2019-11-06 22:24:19,566 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 625 transitions. Word has length 106 [2019-11-06 22:24:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:19,567 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 625 transitions. [2019-11-06 22:24:19,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 625 transitions. [2019-11-06 22:24:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:19,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:19,579 INFO L410 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-11-06 22:24:19,580 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1958807220, now seen corresponding path program 1 times [2019-11-06 22:24:19,580 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:19,581 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818271821] [2019-11-06 22:24:19,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:19,901 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818271821] [2019-11-06 22:24:19,902 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:19,903 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:19,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596771474] [2019-11-06 22:24:19,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:19,904 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:19,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:19,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:19,906 INFO L87 Difference]: Start difference. First operand 471 states and 625 transitions. Second operand 10 states. [2019-11-06 22:24:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:22,268 INFO L93 Difference]: Finished difference Result 1310 states and 1898 transitions. [2019-11-06 22:24:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 22:24:22,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:22,276 INFO L225 Difference]: With dead ends: 1310 [2019-11-06 22:24:22,276 INFO L226 Difference]: Without dead ends: 860 [2019-11-06 22:24:22,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:24:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-11-06 22:24:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 563. [2019-11-06 22:24:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-06 22:24:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 726 transitions. [2019-11-06 22:24:22,340 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 726 transitions. Word has length 106 [2019-11-06 22:24:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:22,340 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 726 transitions. [2019-11-06 22:24:22,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 726 transitions. [2019-11-06 22:24:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:22,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:22,342 INFO L410 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-11-06 22:24:22,342 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash 426101620, now seen corresponding path program 1 times [2019-11-06 22:24:22,343 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:22,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960329969] [2019-11-06 22:24:22,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:22,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960329969] [2019-11-06 22:24:22,545 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:22,545 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:22,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91452137] [2019-11-06 22:24:22,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:22,546 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:22,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:22,547 INFO L87 Difference]: Start difference. First operand 563 states and 726 transitions. Second operand 10 states. [2019-11-06 22:24:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:25,002 INFO L93 Difference]: Finished difference Result 1520 states and 2136 transitions. [2019-11-06 22:24:25,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:25,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:25,011 INFO L225 Difference]: With dead ends: 1520 [2019-11-06 22:24:25,012 INFO L226 Difference]: Without dead ends: 978 [2019-11-06 22:24:25,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-06 22:24:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 655. [2019-11-06 22:24:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-06 22:24:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 823 transitions. [2019-11-06 22:24:25,077 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 823 transitions. Word has length 106 [2019-11-06 22:24:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:25,078 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 823 transitions. [2019-11-06 22:24:25,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 823 transitions. [2019-11-06 22:24:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:25,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:25,079 INFO L410 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-11-06 22:24:25,080 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash 453167222, now seen corresponding path program 1 times [2019-11-06 22:24:25,080 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:25,081 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224177518] [2019-11-06 22:24:25,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:25,283 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224177518] [2019-11-06 22:24:25,286 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:25,286 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:25,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534018902] [2019-11-06 22:24:25,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:25,287 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:25,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:25,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:25,290 INFO L87 Difference]: Start difference. First operand 655 states and 823 transitions. Second operand 10 states. [2019-11-06 22:24:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:27,796 INFO L93 Difference]: Finished difference Result 1720 states and 2354 transitions. [2019-11-06 22:24:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:27,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:27,805 INFO L225 Difference]: With dead ends: 1720 [2019-11-06 22:24:27,806 INFO L226 Difference]: Without dead ends: 1086 [2019-11-06 22:24:27,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-11-06 22:24:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 741. [2019-11-06 22:24:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-11-06 22:24:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 910 transitions. [2019-11-06 22:24:27,876 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 910 transitions. Word has length 106 [2019-11-06 22:24:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:27,876 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 910 transitions. [2019-11-06 22:24:27,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 910 transitions. [2019-11-06 22:24:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:27,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:27,878 INFO L410 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-11-06 22:24:27,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1483621066, now seen corresponding path program 1 times [2019-11-06 22:24:27,879 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:27,879 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248363156] [2019-11-06 22:24:27,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:28,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248363156] [2019-11-06 22:24:28,107 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:28,107 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:28,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93429637] [2019-11-06 22:24:28,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:28,108 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:28,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:28,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:28,109 INFO L87 Difference]: Start difference. First operand 741 states and 910 transitions. Second operand 10 states. [2019-11-06 22:24:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:30,553 INFO L93 Difference]: Finished difference Result 1738 states and 2239 transitions. [2019-11-06 22:24:30,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:24:30,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:30,559 INFO L225 Difference]: With dead ends: 1738 [2019-11-06 22:24:30,560 INFO L226 Difference]: Without dead ends: 1019 [2019-11-06 22:24:30,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:24:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-06 22:24:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 751. [2019-11-06 22:24:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-06 22:24:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 912 transitions. [2019-11-06 22:24:30,636 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 912 transitions. Word has length 106 [2019-11-06 22:24:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:30,636 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 912 transitions. [2019-11-06 22:24:30,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 912 transitions. [2019-11-06 22:24:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:30,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:30,638 INFO L410 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-11-06 22:24:30,638 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1901017672, now seen corresponding path program 1 times [2019-11-06 22:24:30,639 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:30,639 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580546133] [2019-11-06 22:24:30,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:30,858 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580546133] [2019-11-06 22:24:30,859 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:30,860 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:30,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054706405] [2019-11-06 22:24:30,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:30,861 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:30,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:30,862 INFO L87 Difference]: Start difference. First operand 751 states and 912 transitions. Second operand 10 states. [2019-11-06 22:24:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:33,449 INFO L93 Difference]: Finished difference Result 1734 states and 2203 transitions. [2019-11-06 22:24:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:24:33,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:33,456 INFO L225 Difference]: With dead ends: 1734 [2019-11-06 22:24:33,456 INFO L226 Difference]: Without dead ends: 1005 [2019-11-06 22:24:33,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:24:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-11-06 22:24:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 761. [2019-11-06 22:24:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-06 22:24:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 914 transitions. [2019-11-06 22:24:33,540 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 914 transitions. Word has length 106 [2019-11-06 22:24:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:33,541 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 914 transitions. [2019-11-06 22:24:33,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 914 transitions. [2019-11-06 22:24:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:33,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:33,544 INFO L410 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-11-06 22:24:33,544 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1024998666, now seen corresponding path program 1 times [2019-11-06 22:24:33,545 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:33,545 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428924521] [2019-11-06 22:24:33,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:33,771 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428924521] [2019-11-06 22:24:33,772 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:33,773 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:33,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262674965] [2019-11-06 22:24:33,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:33,775 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:33,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:33,776 INFO L87 Difference]: Start difference. First operand 761 states and 914 transitions. Second operand 10 states. [2019-11-06 22:24:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:36,179 INFO L93 Difference]: Finished difference Result 1736 states and 2175 transitions. [2019-11-06 22:24:36,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:24:36,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:36,186 INFO L225 Difference]: With dead ends: 1736 [2019-11-06 22:24:36,187 INFO L226 Difference]: Without dead ends: 997 [2019-11-06 22:24:36,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:24:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-06 22:24:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 771. [2019-11-06 22:24:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-11-06 22:24:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 916 transitions. [2019-11-06 22:24:36,267 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 916 transitions. Word has length 106 [2019-11-06 22:24:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:36,267 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 916 transitions. [2019-11-06 22:24:36,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 916 transitions. [2019-11-06 22:24:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:36,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:36,269 INFO L410 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-11-06 22:24:36,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -131512328, now seen corresponding path program 1 times [2019-11-06 22:24:36,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:36,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204454869] [2019-11-06 22:24:36,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:36,477 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204454869] [2019-11-06 22:24:36,478 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:36,478 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:36,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388578393] [2019-11-06 22:24:36,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:36,479 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:36,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:36,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:36,479 INFO L87 Difference]: Start difference. First operand 771 states and 916 transitions. Second operand 10 states. [2019-11-06 22:24:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:38,859 INFO L93 Difference]: Finished difference Result 1748 states and 2163 transitions. [2019-11-06 22:24:38,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:24:38,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:38,866 INFO L225 Difference]: With dead ends: 1748 [2019-11-06 22:24:38,866 INFO L226 Difference]: Without dead ends: 999 [2019-11-06 22:24:38,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:24:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-11-06 22:24:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 781. [2019-11-06 22:24:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-11-06 22:24:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 918 transitions. [2019-11-06 22:24:38,984 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 918 transitions. Word has length 106 [2019-11-06 22:24:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:38,985 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 918 transitions. [2019-11-06 22:24:38,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 918 transitions. [2019-11-06 22:24:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:38,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:38,987 INFO L410 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-11-06 22:24:38,987 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash -525879114, now seen corresponding path program 1 times [2019-11-06 22:24:38,988 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:38,988 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115487659] [2019-11-06 22:24:38,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:39,225 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115487659] [2019-11-06 22:24:39,225 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:39,226 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:39,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591661684] [2019-11-06 22:24:39,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:39,226 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:39,227 INFO L87 Difference]: Start difference. First operand 781 states and 918 transitions. Second operand 10 states. [2019-11-06 22:24:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:41,010 INFO L93 Difference]: Finished difference Result 1733 states and 2087 transitions. [2019-11-06 22:24:41,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:41,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-11-06 22:24:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:41,019 INFO L225 Difference]: With dead ends: 1733 [2019-11-06 22:24:41,020 INFO L226 Difference]: Without dead ends: 973 [2019-11-06 22:24:41,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-11-06 22:24:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 781. [2019-11-06 22:24:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-11-06 22:24:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 909 transitions. [2019-11-06 22:24:41,161 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 909 transitions. Word has length 106 [2019-11-06 22:24:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:41,161 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 909 transitions. [2019-11-06 22:24:41,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 909 transitions. [2019-11-06 22:24:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:24:41,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:41,164 INFO L410 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-11-06 22:24:41,165 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:41,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash 860324280, now seen corresponding path program 1 times [2019-11-06 22:24:41,165 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:41,166 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727563250] [2019-11-06 22:24:41,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:41,468 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727563250] [2019-11-06 22:24:41,468 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:41,469 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:24:41,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674946842] [2019-11-06 22:24:41,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:24:41,470 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:24:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:24:41,471 INFO L87 Difference]: Start difference. First operand 781 states and 909 transitions. Second operand 7 states.