/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:56:44,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:56:44,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:56:44,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:56:44,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:56:44,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:56:44,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:56:44,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:56:44,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:56:44,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:56:44,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:56:44,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:56:44,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:56:44,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:56:44,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:56:44,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:56:44,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:56:44,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:56:44,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:56:44,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:56:44,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:56:44,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:56:44,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:56:44,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:56:44,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:56:44,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:56:44,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:56:44,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:56:44,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:56:44,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:56:44,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:56:44,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:56:44,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:56:44,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:56:44,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:56:44,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:56:44,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:56:44,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:56:44,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:56:44,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:56:44,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:56:44,826 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 [2020-10-23 18:56:44,856 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:56:44,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:56:44,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:56:44,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:56:44,859 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:56:44,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:56:44,860 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:56:44,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:56:44,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:56:44,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:56:44,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:56:44,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:56:44,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:56:44,862 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:56:44,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:56:44,862 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:56:44,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:56:44,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:56:44,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:56:44,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:56:44,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:56:44,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:56:44,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:56:44,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:56:44,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:56:44,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:56:44,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:56:44,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:56:44,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:56:44,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 18:56:45,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:56:45,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:56:45,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:56:45,343 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:56:45,344 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:56:45,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-10-23 18:56:45,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05f6a4a7/fc9045f7017e49a09e1f714b3600dd8a/FLAGc17ee9ac5 [2020-10-23 18:56:46,231 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:56:46,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-10-23 18:56:46,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05f6a4a7/fc9045f7017e49a09e1f714b3600dd8a/FLAGc17ee9ac5 [2020-10-23 18:56:46,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b05f6a4a7/fc9045f7017e49a09e1f714b3600dd8a [2020-10-23 18:56:46,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:56:46,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:56:46,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:56:46,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:56:46,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:56:46,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:56:46" (1/1) ... [2020-10-23 18:56:46,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7897e492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:46, skipping insertion in model container [2020-10-23 18:56:46,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:56:46" (1/1) ... [2020-10-23 18:56:46,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:56:46,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:56:46,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:56:46,942 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:56:46,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:56:47,037 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:56:47,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47 WrapperNode [2020-10-23 18:56:47,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:56:47,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:56:47,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:56:47,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:56:47,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (1/1) ... [2020-10-23 18:56:47,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (1/1) ... [2020-10-23 18:56:47,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (1/1) ... [2020-10-23 18:56:47,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (1/1) ... [2020-10-23 18:56:47,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (1/1) ... [2020-10-23 18:56:47,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (1/1) ... [2020-10-23 18:56:47,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (1/1) ... [2020-10-23 18:56:47,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:56:47,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:56:47,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:56:47,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:56:47,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (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 [2020-10-23 18:56:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:56:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:56:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:56:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-23 18:56:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-23 18:56:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-23 18:56:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-23 18:56:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-23 18:56:47,196 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-23 18:56:47,196 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-23 18:56:47,196 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-23 18:56:47,196 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-23 18:56:47,196 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-23 18:56:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-23 18:56:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-23 18:56:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-23 18:56:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-23 18:56:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-23 18:56:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-23 18:56:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-23 18:56:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-23 18:56:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:56:47,198 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-23 18:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-23 18:56:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-23 18:56:47,200 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-23 18:56:47,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:56:47,200 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-23 18:56:47,200 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-23 18:56:47,200 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-23 18:56:47,200 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-23 18:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-23 18:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-23 18:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-23 18:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-23 18:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-23 18:56:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-23 18:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-23 18:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-23 18:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-23 18:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-23 18:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:56:47,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:56:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:56:47,952 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:56:47,952 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-23 18:56:47,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:56:47 BoogieIcfgContainer [2020-10-23 18:56:47,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:56:47,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:56:47,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:56:47,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:56:47,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:56:46" (1/3) ... [2020-10-23 18:56:47,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6cc290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:56:47, skipping insertion in model container [2020-10-23 18:56:47,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:56:47" (2/3) ... [2020-10-23 18:56:47,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6cc290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:56:47, skipping insertion in model container [2020-10-23 18:56:47,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:56:47" (3/3) ... [2020-10-23 18:56:47,967 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-10-23 18:56:47,983 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:56:47,989 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:56:48,006 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:56:48,041 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:56:48,042 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:56:48,042 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:56:48,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:56:48,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:56:48,042 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:56:48,043 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:56:48,043 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:56:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2020-10-23 18:56:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:56:48,082 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:56:48,084 INFO L422 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] [2020-10-23 18:56:48,084 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:56:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:56:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash -309336953, now seen corresponding path program 1 times [2020-10-23 18:56:48,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:56:48,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559108684] [2020-10-23 18:56:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:56:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:56:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:56:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:56:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:56:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:56:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:56:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:56:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:56:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:56:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:56:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:56:48,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559108684] [2020-10-23 18:56:48,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:56:48,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:56:48,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147925327] [2020-10-23 18:56:48,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:56:48,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:56:48,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:56:48,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:56:48,944 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 8 states. [2020-10-23 18:56:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:56:51,644 INFO L93 Difference]: Finished difference Result 533 states and 809 transitions. [2020-10-23 18:56:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 18:56:51,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2020-10-23 18:56:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:56:51,668 INFO L225 Difference]: With dead ends: 533 [2020-10-23 18:56:51,668 INFO L226 Difference]: Without dead ends: 378 [2020-10-23 18:56:51,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-10-23 18:56:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-10-23 18:56:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 258. [2020-10-23 18:56:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-10-23 18:56:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 348 transitions. [2020-10-23 18:56:51,838 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 348 transitions. Word has length 79 [2020-10-23 18:56:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:56:51,839 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 348 transitions. [2020-10-23 18:56:51,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:56:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2020-10-23 18:56:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:56:51,844 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:56:51,844 INFO L422 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] [2020-10-23 18:56:51,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:56:51,845 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:56:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:56:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1510595527, now seen corresponding path program 1 times [2020-10-23 18:56:51,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:56:51,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135982107] [2020-10-23 18:56:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:56:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:51,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:56:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:51,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:56:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:51,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:56:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:56:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:56:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:56:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:56:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:56:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:56:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:56:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:56:52,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135982107] [2020-10-23 18:56:52,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:56:52,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:56:52,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008467824] [2020-10-23 18:56:52,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:56:52,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:56:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:56:52,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:56:52,110 INFO L87 Difference]: Start difference. First operand 258 states and 348 transitions. Second operand 9 states. [2020-10-23 18:56:52,512 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2020-10-23 18:56:53,962 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-10-23 18:56:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:56:56,083 INFO L93 Difference]: Finished difference Result 961 states and 1369 transitions. [2020-10-23 18:56:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:56:56,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2020-10-23 18:56:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:56:56,096 INFO L225 Difference]: With dead ends: 961 [2020-10-23 18:56:56,097 INFO L226 Difference]: Without dead ends: 722 [2020-10-23 18:56:56,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:56:56,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2020-10-23 18:56:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 489. [2020-10-23 18:56:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-10-23 18:56:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 666 transitions. [2020-10-23 18:56:56,269 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 666 transitions. Word has length 79 [2020-10-23 18:56:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:56:56,270 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 666 transitions. [2020-10-23 18:56:56,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:56:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 666 transitions. [2020-10-23 18:56:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:56:56,283 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:56:56,284 INFO L422 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] [2020-10-23 18:56:56,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:56:56,284 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:56:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:56:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1523454519, now seen corresponding path program 1 times [2020-10-23 18:56:56,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:56:56,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807739194] [2020-10-23 18:56:56,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:56:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:56:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:56:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:56:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:56:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:56:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:56:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:56:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:56:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:56:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:56:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:56:56,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807739194] [2020-10-23 18:56:56,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:56:56,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:56:56,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066964340] [2020-10-23 18:56:56,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:56:56,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:56:56,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:56:56,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:56:56,612 INFO L87 Difference]: Start difference. First operand 489 states and 666 transitions. Second operand 10 states. [2020-10-23 18:56:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:56:58,788 INFO L93 Difference]: Finished difference Result 1337 states and 1948 transitions. [2020-10-23 18:56:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:56:58,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-23 18:56:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:56:58,802 INFO L225 Difference]: With dead ends: 1337 [2020-10-23 18:56:58,802 INFO L226 Difference]: Without dead ends: 868 [2020-10-23 18:56:58,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:56:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2020-10-23 18:56:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 591. [2020-10-23 18:56:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-23 18:56:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 771 transitions. [2020-10-23 18:56:58,963 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 771 transitions. Word has length 79 [2020-10-23 18:56:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:56:58,965 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 771 transitions. [2020-10-23 18:56:58,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:56:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 771 transitions. [2020-10-23 18:56:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:56:58,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:56:58,970 INFO L422 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] [2020-10-23 18:56:58,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:56:58,970 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:56:58,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:56:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash 440448265, now seen corresponding path program 1 times [2020-10-23 18:56:58,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:56:58,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138669729] [2020-10-23 18:56:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:56:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:56:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:56:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:56:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:56:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:56:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:56:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:56:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:56:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:56:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:56:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:56:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:56:59,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138669729] [2020-10-23 18:56:59,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:56:59,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:56:59,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422955112] [2020-10-23 18:56:59,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:56:59,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:56:59,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:56:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:56:59,245 INFO L87 Difference]: Start difference. First operand 591 states and 771 transitions. Second operand 9 states. [2020-10-23 18:57:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:02,882 INFO L93 Difference]: Finished difference Result 1905 states and 2577 transitions. [2020-10-23 18:57:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:57:02,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2020-10-23 18:57:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:02,902 INFO L225 Difference]: With dead ends: 1905 [2020-10-23 18:57:02,902 INFO L226 Difference]: Without dead ends: 1477 [2020-10-23 18:57:02,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:57:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-10-23 18:57:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1064. [2020-10-23 18:57:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-10-23 18:57:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1394 transitions. [2020-10-23 18:57:03,068 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1394 transitions. Word has length 79 [2020-10-23 18:57:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:03,069 INFO L481 AbstractCegarLoop]: Abstraction has 1064 states and 1394 transitions. [2020-10-23 18:57:03,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1394 transitions. [2020-10-23 18:57:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:57:03,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:03,071 INFO L422 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] [2020-10-23 18:57:03,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:57:03,071 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1827233675, now seen corresponding path program 1 times [2020-10-23 18:57:03,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:03,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198348400] [2020-10-23 18:57:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:03,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198348400] [2020-10-23 18:57:03,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:03,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:03,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21749671] [2020-10-23 18:57:03,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:03,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:03,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:03,340 INFO L87 Difference]: Start difference. First operand 1064 states and 1394 transitions. Second operand 10 states. [2020-10-23 18:57:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:05,366 INFO L93 Difference]: Finished difference Result 2396 states and 3219 transitions. [2020-10-23 18:57:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:57:05,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-23 18:57:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:05,376 INFO L225 Difference]: With dead ends: 2396 [2020-10-23 18:57:05,376 INFO L226 Difference]: Without dead ends: 1352 [2020-10-23 18:57:05,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-10-23 18:57:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-10-23 18:57:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1109. [2020-10-23 18:57:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2020-10-23 18:57:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1432 transitions. [2020-10-23 18:57:05,514 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1432 transitions. Word has length 79 [2020-10-23 18:57:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:05,517 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1432 transitions. [2020-10-23 18:57:05,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1432 transitions. [2020-10-23 18:57:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:57:05,525 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:05,526 INFO L422 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] [2020-10-23 18:57:05,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:57:05,526 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2075380169, now seen corresponding path program 1 times [2020-10-23 18:57:05,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:05,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310595663] [2020-10-23 18:57:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:05,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310595663] [2020-10-23 18:57:05,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:05,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:05,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766751018] [2020-10-23 18:57:05,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:05,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:05,838 INFO L87 Difference]: Start difference. First operand 1109 states and 1432 transitions. Second operand 10 states. [2020-10-23 18:57:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:07,576 INFO L93 Difference]: Finished difference Result 2521 states and 3341 transitions. [2020-10-23 18:57:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:07,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-23 18:57:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:07,586 INFO L225 Difference]: With dead ends: 2521 [2020-10-23 18:57:07,586 INFO L226 Difference]: Without dead ends: 1432 [2020-10-23 18:57:07,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-10-23 18:57:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1179. [2020-10-23 18:57:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2020-10-23 18:57:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1500 transitions. [2020-10-23 18:57:07,728 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1500 transitions. Word has length 79 [2020-10-23 18:57:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:07,730 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1500 transitions. [2020-10-23 18:57:07,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1500 transitions. [2020-10-23 18:57:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:57:07,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:07,734 INFO L422 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] [2020-10-23 18:57:07,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:57:07,734 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2002993611, now seen corresponding path program 1 times [2020-10-23 18:57:07,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:07,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585997953] [2020-10-23 18:57:07,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:07,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585997953] [2020-10-23 18:57:07,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:07,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:07,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305343375] [2020-10-23 18:57:07,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:07,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:07,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:07,992 INFO L87 Difference]: Start difference. First operand 1179 states and 1500 transitions. Second operand 10 states. [2020-10-23 18:57:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:10,482 INFO L93 Difference]: Finished difference Result 2551 states and 3333 transitions. [2020-10-23 18:57:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 18:57:10,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-23 18:57:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:10,496 INFO L225 Difference]: With dead ends: 2551 [2020-10-23 18:57:10,496 INFO L226 Difference]: Without dead ends: 1393 [2020-10-23 18:57:10,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2020-10-23 18:57:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-10-23 18:57:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1027. [2020-10-23 18:57:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1027 states. [2020-10-23 18:57:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1270 transitions. [2020-10-23 18:57:10,645 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1270 transitions. Word has length 79 [2020-10-23 18:57:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:10,645 INFO L481 AbstractCegarLoop]: Abstraction has 1027 states and 1270 transitions. [2020-10-23 18:57:10,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1270 transitions. [2020-10-23 18:57:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-23 18:57:10,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:10,647 INFO L422 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] [2020-10-23 18:57:10,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:57:10,647 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2065033225, now seen corresponding path program 1 times [2020-10-23 18:57:10,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:10,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596203050] [2020-10-23 18:57:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:10,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596203050] [2020-10-23 18:57:10,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:10,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:57:10,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737502658] [2020-10-23 18:57:10,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:57:10,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:57:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:57:10,859 INFO L87 Difference]: Start difference. First operand 1027 states and 1270 transitions. Second operand 7 states. [2020-10-23 18:57:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:12,691 INFO L93 Difference]: Finished difference Result 2923 states and 3855 transitions. [2020-10-23 18:57:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:57:12,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-10-23 18:57:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:12,705 INFO L225 Difference]: With dead ends: 2923 [2020-10-23 18:57:12,705 INFO L226 Difference]: Without dead ends: 1928 [2020-10-23 18:57:12,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:57:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2020-10-23 18:57:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1600. [2020-10-23 18:57:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2020-10-23 18:57:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2029 transitions. [2020-10-23 18:57:12,941 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2029 transitions. Word has length 79 [2020-10-23 18:57:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:12,942 INFO L481 AbstractCegarLoop]: Abstraction has 1600 states and 2029 transitions. [2020-10-23 18:57:12,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:57:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2029 transitions. [2020-10-23 18:57:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-10-23 18:57:12,946 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:12,946 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:12,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 18:57:12,947 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1649947512, now seen corresponding path program 1 times [2020-10-23 18:57:12,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:12,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834983635] [2020-10-23 18:57:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:57:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:57:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-23 18:57:13,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834983635] [2020-10-23 18:57:13,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:13,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:13,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462193517] [2020-10-23 18:57:13,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:13,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:13,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:13,329 INFO L87 Difference]: Start difference. First operand 1600 states and 2029 transitions. Second operand 10 states. [2020-10-23 18:57:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:16,113 INFO L93 Difference]: Finished difference Result 5046 states and 7077 transitions. [2020-10-23 18:57:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 18:57:16,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2020-10-23 18:57:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:16,142 INFO L225 Difference]: With dead ends: 5046 [2020-10-23 18:57:16,143 INFO L226 Difference]: Without dead ends: 3502 [2020-10-23 18:57:16,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2020-10-23 18:57:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2020-10-23 18:57:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2846. [2020-10-23 18:57:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2020-10-23 18:57:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3790 transitions. [2020-10-23 18:57:16,562 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3790 transitions. Word has length 124 [2020-10-23 18:57:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:16,562 INFO L481 AbstractCegarLoop]: Abstraction has 2846 states and 3790 transitions. [2020-10-23 18:57:16,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3790 transitions. [2020-10-23 18:57:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-10-23 18:57:16,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:16,568 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:16,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:57:16,569 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash -491912966, now seen corresponding path program 1 times [2020-10-23 18:57:16,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:16,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006921677] [2020-10-23 18:57:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:57:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:57:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-23 18:57:16,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006921677] [2020-10-23 18:57:16,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:16,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:57:16,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014796355] [2020-10-23 18:57:16,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:57:16,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:16,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:57:16,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:16,776 INFO L87 Difference]: Start difference. First operand 2846 states and 3790 transitions. Second operand 9 states. [2020-10-23 18:57:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:18,342 INFO L93 Difference]: Finished difference Result 6064 states and 8149 transitions. [2020-10-23 18:57:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 18:57:18,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2020-10-23 18:57:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:18,366 INFO L225 Difference]: With dead ends: 6064 [2020-10-23 18:57:18,367 INFO L226 Difference]: Without dead ends: 3273 [2020-10-23 18:57:18,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:57:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2020-10-23 18:57:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2806. [2020-10-23 18:57:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2806 states. [2020-10-23 18:57:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 3742 transitions. [2020-10-23 18:57:18,762 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 3742 transitions. Word has length 124 [2020-10-23 18:57:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:18,763 INFO L481 AbstractCegarLoop]: Abstraction has 2806 states and 3742 transitions. [2020-10-23 18:57:18,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 3742 transitions. [2020-10-23 18:57:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-10-23 18:57:18,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:18,767 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:18,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 18:57:18,768 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:18,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash -425217590, now seen corresponding path program 1 times [2020-10-23 18:57:18,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:18,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391992592] [2020-10-23 18:57:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:57:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:18,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-23 18:57:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-23 18:57:19,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391992592] [2020-10-23 18:57:19,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:19,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 18:57:19,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210405839] [2020-10-23 18:57:19,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:57:19,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:19,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:57:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:57:19,018 INFO L87 Difference]: Start difference. First operand 2806 states and 3742 transitions. Second operand 11 states. [2020-10-23 18:57:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:24,374 INFO L93 Difference]: Finished difference Result 9074 states and 12619 transitions. [2020-10-23 18:57:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-23 18:57:24,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2020-10-23 18:57:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:24,404 INFO L225 Difference]: With dead ends: 9074 [2020-10-23 18:57:24,405 INFO L226 Difference]: Without dead ends: 4623 [2020-10-23 18:57:24,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=1307, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 18:57:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2020-10-23 18:57:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4039. [2020-10-23 18:57:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4039 states. [2020-10-23 18:57:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 5184 transitions. [2020-10-23 18:57:24,995 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 5184 transitions. Word has length 125 [2020-10-23 18:57:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:24,995 INFO L481 AbstractCegarLoop]: Abstraction has 4039 states and 5184 transitions. [2020-10-23 18:57:24,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:57:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 5184 transitions. [2020-10-23 18:57:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-10-23 18:57:25,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:25,001 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:25,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 18:57:25,002 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1851403327, now seen corresponding path program 1 times [2020-10-23 18:57:25,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:25,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416471472] [2020-10-23 18:57:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:57:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:57:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:57:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-23 18:57:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-10-23 18:57:25,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416471472] [2020-10-23 18:57:25,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:25,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:25,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621108809] [2020-10-23 18:57:25,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:25,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:25,317 INFO L87 Difference]: Start difference. First operand 4039 states and 5184 transitions. Second operand 10 states. [2020-10-23 18:57:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:27,854 INFO L93 Difference]: Finished difference Result 9305 states and 12571 transitions. [2020-10-23 18:57:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 18:57:27,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2020-10-23 18:57:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:27,890 INFO L225 Difference]: With dead ends: 9305 [2020-10-23 18:57:27,890 INFO L226 Difference]: Without dead ends: 5313 [2020-10-23 18:57:27,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2020-10-23 18:57:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2020-10-23 18:57:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 4830. [2020-10-23 18:57:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2020-10-23 18:57:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 6060 transitions. [2020-10-23 18:57:28,543 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 6060 transitions. Word has length 159 [2020-10-23 18:57:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:28,544 INFO L481 AbstractCegarLoop]: Abstraction has 4830 states and 6060 transitions. [2020-10-23 18:57:28,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 6060 transitions. [2020-10-23 18:57:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-10-23 18:57:28,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:28,552 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:28,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 18:57:28,552 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:28,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1869117932, now seen corresponding path program 1 times [2020-10-23 18:57:28,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:28,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116144746] [2020-10-23 18:57:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:57:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:57:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-10-23 18:57:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-10-23 18:57:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:57:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-10-23 18:57:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-23 18:57:28,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116144746] [2020-10-23 18:57:28,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049979638] [2020-10-23 18:57:28,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:57:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:57:29,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:57:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-23 18:57:29,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:57:29,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2020-10-23 18:57:29,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436675723] [2020-10-23 18:57:29,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:57:29,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:57:29,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:57:29,345 INFO L87 Difference]: Start difference. First operand 4830 states and 6060 transitions. Second operand 3 states. [2020-10-23 18:57:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:30,031 INFO L93 Difference]: Finished difference Result 8564 states and 11269 transitions. [2020-10-23 18:57:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:57:30,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-10-23 18:57:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:30,072 INFO L225 Difference]: With dead ends: 8564 [2020-10-23 18:57:30,073 INFO L226 Difference]: Without dead ends: 4654 [2020-10-23 18:57:30,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:57:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2020-10-23 18:57:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4648. [2020-10-23 18:57:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4648 states. [2020-10-23 18:57:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 5715 transitions. [2020-10-23 18:57:30,735 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 5715 transitions. Word has length 178 [2020-10-23 18:57:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:30,736 INFO L481 AbstractCegarLoop]: Abstraction has 4648 states and 5715 transitions. [2020-10-23 18:57:30,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:57:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 5715 transitions. [2020-10-23 18:57:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-23 18:57:30,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:30,744 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:30,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-23 18:57:30,958 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1883740737, now seen corresponding path program 1 times [2020-10-23 18:57:30,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:30,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610156746] [2020-10-23 18:57:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:57:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:57:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-10-23 18:57:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-10-23 18:57:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:57:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-23 18:57:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-10-23 18:57:31,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610156746] [2020-10-23 18:57:31,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795694623] [2020-10-23 18:57:31,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:57:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:57:31,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:57:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-23 18:57:31,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:57:31,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 12 [2020-10-23 18:57:31,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325220284] [2020-10-23 18:57:31,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:57:31,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:57:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:57:31,459 INFO L87 Difference]: Start difference. First operand 4648 states and 5715 transitions. Second operand 3 states. [2020-10-23 18:57:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:31,802 INFO L93 Difference]: Finished difference Result 6539 states and 8106 transitions. [2020-10-23 18:57:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:57:31,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2020-10-23 18:57:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:31,815 INFO L225 Difference]: With dead ends: 6539 [2020-10-23 18:57:31,815 INFO L226 Difference]: Without dead ends: 1872 [2020-10-23 18:57:31,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:57:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2020-10-23 18:57:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1862. [2020-10-23 18:57:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1862 states. [2020-10-23 18:57:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2143 transitions. [2020-10-23 18:57:32,097 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2143 transitions. Word has length 179 [2020-10-23 18:57:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:32,098 INFO L481 AbstractCegarLoop]: Abstraction has 1862 states and 2143 transitions. [2020-10-23 18:57:32,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:57:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2143 transitions. [2020-10-23 18:57:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-23 18:57:32,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:32,102 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:32,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-10-23 18:57:32,316 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2051497620, now seen corresponding path program 1 times [2020-10-23 18:57:32,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:32,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423917292] [2020-10-23 18:57:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-10-23 18:57:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-23 18:57:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-10-23 18:57:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:57:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-23 18:57:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-10-23 18:57:32,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423917292] [2020-10-23 18:57:32,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775873884] [2020-10-23 18:57:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:57:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-23 18:57:32,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:57:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-23 18:57:32,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:57:32,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-10-23 18:57:32,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198513845] [2020-10-23 18:57:32,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:57:32,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:32,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:57:32,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:57:32,961 INFO L87 Difference]: Start difference. First operand 1862 states and 2143 transitions. Second operand 12 states. [2020-10-23 18:57:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:35,608 INFO L93 Difference]: Finished difference Result 2174 states and 2502 transitions. [2020-10-23 18:57:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 18:57:35,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2020-10-23 18:57:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:35,621 INFO L225 Difference]: With dead ends: 2174 [2020-10-23 18:57:35,621 INFO L226 Difference]: Without dead ends: 2170 [2020-10-23 18:57:35,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-10-23 18:57:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2020-10-23 18:57:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1877. [2020-10-23 18:57:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2020-10-23 18:57:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2161 transitions. [2020-10-23 18:57:35,912 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2161 transitions. Word has length 179 [2020-10-23 18:57:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:35,913 INFO L481 AbstractCegarLoop]: Abstraction has 1877 states and 2161 transitions. [2020-10-23 18:57:35,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:57:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2161 transitions. [2020-10-23 18:57:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2020-10-23 18:57:35,917 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:35,918 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:36,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-10-23 18:57:36,131 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash 54468076, now seen corresponding path program 1 times [2020-10-23 18:57:36,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:36,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842103965] [2020-10-23 18:57:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-23 18:57:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-10-23 18:57:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-10-23 18:57:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-10-23 18:57:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:57:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-10-23 18:57:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:57:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-23 18:57:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-10-23 18:57:36,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842103965] [2020-10-23 18:57:36,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114645301] [2020-10-23 18:57:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:57:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:57:36,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:57:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-10-23 18:57:36,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:57:36,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-10-23 18:57:36,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178204492] [2020-10-23 18:57:36,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:57:36,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:36,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:57:36,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:36,562 INFO L87 Difference]: Start difference. First operand 1877 states and 2161 transitions. Second operand 3 states. [2020-10-23 18:57:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:36,835 INFO L93 Difference]: Finished difference Result 3190 states and 3716 transitions. [2020-10-23 18:57:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:57:36,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2020-10-23 18:57:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:36,847 INFO L225 Difference]: With dead ends: 3190 [2020-10-23 18:57:36,847 INFO L226 Difference]: Without dead ends: 1905 [2020-10-23 18:57:36,852 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2020-10-23 18:57:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1905. [2020-10-23 18:57:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2020-10-23 18:57:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2197 transitions. [2020-10-23 18:57:37,104 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2197 transitions. Word has length 183 [2020-10-23 18:57:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:37,105 INFO L481 AbstractCegarLoop]: Abstraction has 1905 states and 2197 transitions. [2020-10-23 18:57:37,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:57:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2197 transitions. [2020-10-23 18:57:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-23 18:57:37,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:37,110 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:37,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:57:37,325 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1140527567, now seen corresponding path program 1 times [2020-10-23 18:57:37,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:37,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21308824] [2020-10-23 18:57:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:57:37,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:57:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:57:37,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:57:37,504 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:57:37,504 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:57:37,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 18:57:37,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:57:37 BoogieIcfgContainer [2020-10-23 18:57:37,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:57:37,778 INFO L168 Benchmark]: Toolchain (without parser) took 51192.56 ms. Allocated memory was 125.8 MB in the beginning and 863.0 MB in the end (delta: 737.1 MB). Free memory was 101.7 MB in the beginning and 553.5 MB in the end (delta: -451.7 MB). Peak memory consumption was 286.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:37,781 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory is still 86.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:57:37,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.07 ms. Allocated memory is still 125.8 MB. Free memory was 101.0 MB in the beginning and 88.2 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:37,784 INFO L168 Benchmark]: Boogie Preprocessor took 58.74 ms. Allocated memory is still 125.8 MB. Free memory was 88.2 MB in the beginning and 86.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:37,785 INFO L168 Benchmark]: RCFGBuilder took 856.82 ms. Allocated memory was 125.8 MB in the beginning and 157.3 MB in the end (delta: 31.5 MB). Free memory was 86.1 MB in the beginning and 118.3 MB in the end (delta: -32.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:37,785 INFO L168 Benchmark]: TraceAbstraction took 49818.40 ms. Allocated memory was 157.3 MB in the beginning and 863.0 MB in the end (delta: 705.7 MB). Free memory was 118.3 MB in the beginning and 553.5 MB in the end (delta: -435.2 MB). Peak memory consumption was 270.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:37,795 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 125.8 MB. Free memory is still 86.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 443.07 ms. Allocated memory is still 125.8 MB. Free memory was 101.0 MB in the beginning and 88.2 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.74 ms. Allocated memory is still 125.8 MB. Free memory was 88.2 MB in the beginning and 86.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 856.82 ms. Allocated memory was 125.8 MB in the beginning and 157.3 MB in the end (delta: 31.5 MB). Free memory was 86.1 MB in the beginning and 118.3 MB in the end (delta: -32.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49818.40 ms. Allocated memory was 157.3 MB in the beginning and 863.0 MB in the end (delta: 705.7 MB). Free memory was 118.3 MB in the beginning and 553.5 MB in the end (delta: -435.2 MB). Peak memory consumption was 270.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L481] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L392] m_i = 1 [L393] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L481] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L482] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L428] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=0] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-2, token=0] [L47] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-2, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=-2, token=0] [L53] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L53] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=-2, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=-2, token=0] [L230] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 [L112] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=1, token=1] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L39] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L61] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L66] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L67] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] CALL reach_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L3] __assert_fail("0", "token_ring.01.cil-2.c", 3, "reach_error") VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 155 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 49.4s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2989 SDtfs, 10887 SDslu, 952 SDs, 0 SdLazy, 16499 SolverSat, 6178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1570 GetRequests, 1271 SyntacticMatches, 6 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4830occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 4732 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2786 NumberOfCodeBlocks, 2786 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2582 ConstructedInterpolants, 0 QuantifiedInterpolants, 864639 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3144 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 996/1031 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...