/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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:57:31,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:57:31,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:57:31,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:57:31,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:57:31,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:57:31,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:57:31,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:57:31,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:57:31,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:57:31,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:57:31,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:57:31,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:57:31,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:57:31,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:57:31,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:57:31,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:57:31,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:57:31,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:57:31,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:57:31,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:57:31,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:57:31,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:57:31,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:57:31,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:57:31,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:57:31,823 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:57:31,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:57:31,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:57:31,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:57:31,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:57:31,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:57:31,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:57:31,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:57:31,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:57:31,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:57:31,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:57:31,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:57:31,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:57:31,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:57:31,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:57:31,856 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:57:31,912 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:57:31,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:57:31,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:57:31,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:57:31,916 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:57:31,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:57:31,918 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:57:31,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:57:31,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:57:31,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:57:31,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:57:31,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:57:31,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:57:31,921 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:57:31,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:57:31,921 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:57:31,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:57:31,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:57:31,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:57:31,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:57:31,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:57:31,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:57:31,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:57:31,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:57:31,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:57:31,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:57:31,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:57:31,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:57:31,924 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:57:31,924 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:57:32,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:57:32,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:57:32,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:57:32,449 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:57:32,449 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:57:32,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-10-23 18:57:32,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40105bb29/7622d0e151a74118bbf65ce23038022b/FLAG99f8d17b9 [2020-10-23 18:57:33,288 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:57:33,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-10-23 18:57:33,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40105bb29/7622d0e151a74118bbf65ce23038022b/FLAG99f8d17b9 [2020-10-23 18:57:33,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40105bb29/7622d0e151a74118bbf65ce23038022b [2020-10-23 18:57:33,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:57:33,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:57:33,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:57:33,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:57:33,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:57:33,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:33" (1/1) ... [2020-10-23 18:57:33,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2351fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:33, skipping insertion in model container [2020-10-23 18:57:33,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:33" (1/1) ... [2020-10-23 18:57:33,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:57:33,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:57:34,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:57:34,105 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:57:34,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:57:34,226 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:57:34,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34 WrapperNode [2020-10-23 18:57:34,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:57:34,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:57:34,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:57:34,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:57:34,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (1/1) ... [2020-10-23 18:57:34,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (1/1) ... [2020-10-23 18:57:34,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (1/1) ... [2020-10-23 18:57:34,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (1/1) ... [2020-10-23 18:57:34,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (1/1) ... [2020-10-23 18:57:34,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (1/1) ... [2020-10-23 18:57:34,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (1/1) ... [2020-10-23 18:57:34,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:57:34,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:57:34,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:57:34,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:57:34,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (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:57:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:57:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:57:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:57:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-23 18:57:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-23 18:57:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-23 18:57:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-10-23 18:57:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-23 18:57:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-23 18:57:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-10-23 18:57:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-23 18:57:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-23 18:57:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-23 18:57:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-23 18:57:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-23 18:57:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-23 18:57:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-23 18:57:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-23 18:57:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-23 18:57:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-23 18:57:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-23 18:57:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-23 18:57:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-23 18:57:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:57:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:57:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:57:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:57:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:57:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:57:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-23 18:57:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-23 18:57:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-23 18:57:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-10-23 18:57:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-23 18:57:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-23 18:57:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-23 18:57:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-10-23 18:57:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-23 18:57:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-23 18:57:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-23 18:57:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-23 18:57:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-23 18:57:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-23 18:57:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-23 18:57:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-23 18:57:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-23 18:57:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-23 18:57:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-23 18:57:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-23 18:57:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:57:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:57:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:57:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:57:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:57:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:57:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:57:35,180 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:57:35,180 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-23 18:57:35,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:35 BoogieIcfgContainer [2020-10-23 18:57:35,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:57:35,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:57:35,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:57:35,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:57:35,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:57:33" (1/3) ... [2020-10-23 18:57:35,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d11fe38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:35, skipping insertion in model container [2020-10-23 18:57:35,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:34" (2/3) ... [2020-10-23 18:57:35,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d11fe38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:35, skipping insertion in model container [2020-10-23 18:57:35,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:35" (3/3) ... [2020-10-23 18:57:35,193 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-10-23 18:57:35,212 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:57:35,221 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:57:35,236 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:57:35,267 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:57:35,267 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:57:35,267 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:57:35,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:57:35,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:57:35,268 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:57:35,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:57:35,271 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:57:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2020-10-23 18:57:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:35,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:35,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:35,312 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1259976034, now seen corresponding path program 1 times [2020-10-23 18:57:35,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:35,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725985108] [2020-10-23 18:57:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:35,836 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-23 18:57:35,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:35,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:35,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:35,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,135 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:36,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725985108] [2020-10-23 18:57:36,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:36,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:57:36,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653523483] [2020-10-23 18:57:36,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:57:36,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:57:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:36,173 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 9 states. [2020-10-23 18:57:36,464 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-23 18:57:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:40,572 INFO L93 Difference]: Finished difference Result 613 states and 953 transitions. [2020-10-23 18:57:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:57:40,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2020-10-23 18:57:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:40,622 INFO L225 Difference]: With dead ends: 613 [2020-10-23 18:57:40,622 INFO L226 Difference]: Without dead ends: 441 [2020-10-23 18:57:40,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-10-23 18:57:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 295. [2020-10-23 18:57:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-23 18:57:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2020-10-23 18:57:40,776 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 91 [2020-10-23 18:57:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:40,777 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2020-10-23 18:57:40,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2020-10-23 18:57:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:40,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:40,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:40,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:57:40,783 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash -351665279, now seen corresponding path program 1 times [2020-10-23 18:57:40,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:40,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516377346] [2020-10-23 18:57:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:41,172 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:41,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516377346] [2020-10-23 18:57:41,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:41,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:41,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194315925] [2020-10-23 18:57:41,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:41,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:41,177 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 10 states. [2020-10-23 18:57:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:43,263 INFO L93 Difference]: Finished difference Result 706 states and 996 transitions. [2020-10-23 18:57:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:57:43,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-10-23 18:57:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:43,273 INFO L225 Difference]: With dead ends: 706 [2020-10-23 18:57:43,274 INFO L226 Difference]: Without dead ends: 431 [2020-10-23 18:57:43,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 18:57:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-23 18:57:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 295. [2020-10-23 18:57:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-23 18:57:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 388 transitions. [2020-10-23 18:57:43,370 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 388 transitions. Word has length 91 [2020-10-23 18:57:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:43,371 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 388 transitions. [2020-10-23 18:57:43,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 388 transitions. [2020-10-23 18:57:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:43,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:43,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:43,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:57:43,374 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1988478273, now seen corresponding path program 1 times [2020-10-23 18:57:43,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:43,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829200227] [2020-10-23 18:57:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:43,637 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:43,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829200227] [2020-10-23 18:57:43,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:43,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:43,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952784316] [2020-10-23 18:57:43,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:43,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:43,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:43,640 INFO L87 Difference]: Start difference. First operand 295 states and 388 transitions. Second operand 10 states. [2020-10-23 18:57:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:45,627 INFO L93 Difference]: Finished difference Result 702 states and 974 transitions. [2020-10-23 18:57:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:57:45,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-10-23 18:57:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:45,634 INFO L225 Difference]: With dead ends: 702 [2020-10-23 18:57:45,634 INFO L226 Difference]: Without dead ends: 427 [2020-10-23 18:57:45,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 18:57:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-23 18:57:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 295. [2020-10-23 18:57:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-23 18:57:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 381 transitions. [2020-10-23 18:57:45,707 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 381 transitions. Word has length 91 [2020-10-23 18:57:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:45,710 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 381 transitions. [2020-10-23 18:57:45,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 381 transitions. [2020-10-23 18:57:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:45,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:45,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:45,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:57:45,721 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:45,726 INFO L82 PathProgramCache]: Analyzing trace with hash 262851457, now seen corresponding path program 1 times [2020-10-23 18:57:45,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:45,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658378022] [2020-10-23 18:57:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:45,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:45,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:45,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:45,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:45,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:46,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:46,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:46,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:46,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:46,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:46,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:46,042 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:46,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658378022] [2020-10-23 18:57:46,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:46,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:46,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284452469] [2020-10-23 18:57:46,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:46,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:46,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:46,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:46,045 INFO L87 Difference]: Start difference. First operand 295 states and 381 transitions. Second operand 10 states. [2020-10-23 18:57:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:48,729 INFO L93 Difference]: Finished difference Result 853 states and 1225 transitions. [2020-10-23 18:57:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:57:48,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-10-23 18:57:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:48,735 INFO L225 Difference]: With dead ends: 853 [2020-10-23 18:57:48,735 INFO L226 Difference]: Without dead ends: 578 [2020-10-23 18:57:48,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:57:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-10-23 18:57:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 367. [2020-10-23 18:57:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2020-10-23 18:57:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 459 transitions. [2020-10-23 18:57:48,797 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 459 transitions. Word has length 91 [2020-10-23 18:57:48,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:48,797 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 459 transitions. [2020-10-23 18:57:48,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 459 transitions. [2020-10-23 18:57:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:48,806 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:48,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:48,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:57:48,806 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -469115969, now seen corresponding path program 1 times [2020-10-23 18:57:48,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:48,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812432874] [2020-10-23 18:57:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:48,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:48,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:48,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:48,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:48,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,070 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:49,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812432874] [2020-10-23 18:57:49,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:49,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:57:49,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329857652] [2020-10-23 18:57:49,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:57:49,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:57:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:49,075 INFO L87 Difference]: Start difference. First operand 367 states and 459 transitions. Second operand 9 states. [2020-10-23 18:57:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:51,160 INFO L93 Difference]: Finished difference Result 934 states and 1239 transitions. [2020-10-23 18:57:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 18:57:51,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2020-10-23 18:57:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:51,165 INFO L225 Difference]: With dead ends: 934 [2020-10-23 18:57:51,165 INFO L226 Difference]: Without dead ends: 587 [2020-10-23 18:57:51,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-10-23 18:57:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-10-23 18:57:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2020-10-23 18:57:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-10-23 18:57:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 525 transitions. [2020-10-23 18:57:51,228 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 525 transitions. Word has length 91 [2020-10-23 18:57:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:51,228 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 525 transitions. [2020-10-23 18:57:51,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 525 transitions. [2020-10-23 18:57:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:51,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:51,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:51,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:57:51,231 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1693264994, now seen corresponding path program 1 times [2020-10-23 18:57:51,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:51,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69973296] [2020-10-23 18:57:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:51,504 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:51,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69973296] [2020-10-23 18:57:51,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:51,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:51,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717061648] [2020-10-23 18:57:51,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:51,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:51,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:51,507 INFO L87 Difference]: Start difference. First operand 433 states and 525 transitions. Second operand 10 states. [2020-10-23 18:57:51,962 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-23 18:57:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:53,860 INFO L93 Difference]: Finished difference Result 1020 states and 1306 transitions. [2020-10-23 18:57:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:57:53,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-10-23 18:57:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:53,866 INFO L225 Difference]: With dead ends: 1020 [2020-10-23 18:57:53,866 INFO L226 Difference]: Without dead ends: 608 [2020-10-23 18:57:53,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-10-23 18:57:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-10-23 18:57:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 448. [2020-10-23 18:57:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-10-23 18:57:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 537 transitions. [2020-10-23 18:57:53,936 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 537 transitions. Word has length 91 [2020-10-23 18:57:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:53,937 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 537 transitions. [2020-10-23 18:57:53,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 537 transitions. [2020-10-23 18:57:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:53,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:53,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:53,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:57:53,939 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:53,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash -154924964, now seen corresponding path program 1 times [2020-10-23 18:57:53,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:53,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846353183] [2020-10-23 18:57:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:54,231 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:54,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846353183] [2020-10-23 18:57:54,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:54,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:54,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574446675] [2020-10-23 18:57:54,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:54,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:54,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:54,234 INFO L87 Difference]: Start difference. First operand 448 states and 537 transitions. Second operand 10 states. [2020-10-23 18:57:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:56,664 INFO L93 Difference]: Finished difference Result 1033 states and 1305 transitions. [2020-10-23 18:57:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:56,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-10-23 18:57:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:56,669 INFO L225 Difference]: With dead ends: 1033 [2020-10-23 18:57:56,669 INFO L226 Difference]: Without dead ends: 606 [2020-10-23 18:57:56,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-10-23 18:57:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 458. [2020-10-23 18:57:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-23 18:57:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 543 transitions. [2020-10-23 18:57:56,738 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 543 transitions. Word has length 91 [2020-10-23 18:57:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:56,738 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 543 transitions. [2020-10-23 18:57:56,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 543 transitions. [2020-10-23 18:57:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:56,739 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:56,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:56,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:57:56,740 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1052318242, now seen corresponding path program 1 times [2020-10-23 18:57:56,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:56,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227693490] [2020-10-23 18:57:56,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:56,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:57,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:57,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:57,045 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:57,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227693490] [2020-10-23 18:57:57,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:57,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:57,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057043943] [2020-10-23 18:57:57,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:57,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:57,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:57,048 INFO L87 Difference]: Start difference. First operand 458 states and 543 transitions. Second operand 10 states. [2020-10-23 18:57:57,653 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-23 18:57:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:59,464 INFO L93 Difference]: Finished difference Result 1048 states and 1307 transitions. [2020-10-23 18:57:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:59,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2020-10-23 18:57:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:59,469 INFO L225 Difference]: With dead ends: 1048 [2020-10-23 18:57:59,469 INFO L226 Difference]: Without dead ends: 611 [2020-10-23 18:57:59,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-10-23 18:57:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 468. [2020-10-23 18:57:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-10-23 18:57:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 549 transitions. [2020-10-23 18:57:59,531 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 549 transitions. Word has length 91 [2020-10-23 18:57:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:59,531 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 549 transitions. [2020-10-23 18:57:59,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 549 transitions. [2020-10-23 18:57:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-23 18:57:59,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:59,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:59,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 18:57:59,533 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash 998665756, now seen corresponding path program 1 times [2020-10-23 18:57:59,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:59,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487703219] [2020-10-23 18:57:59,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:57:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:57:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:57:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:59,767 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:59,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487703219] [2020-10-23 18:57:59,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:59,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:57:59,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645957699] [2020-10-23 18:57:59,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:57:59,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:57:59,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:57:59,770 INFO L87 Difference]: Start difference. First operand 468 states and 549 transitions. Second operand 8 states. [2020-10-23 18:58:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:03,015 INFO L93 Difference]: Finished difference Result 1672 states and 2206 transitions. [2020-10-23 18:58:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 18:58:03,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2020-10-23 18:58:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:03,025 INFO L225 Difference]: With dead ends: 1672 [2020-10-23 18:58:03,025 INFO L226 Difference]: Without dead ends: 1226 [2020-10-23 18:58:03,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:58:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-10-23 18:58:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 853. [2020-10-23 18:58:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-10-23 18:58:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1028 transitions. [2020-10-23 18:58:03,146 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1028 transitions. Word has length 91 [2020-10-23 18:58:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:03,146 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1028 transitions. [2020-10-23 18:58:03,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:58:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1028 transitions. [2020-10-23 18:58:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-23 18:58:03,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:03,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:03,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:58:03,149 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash 302356099, now seen corresponding path program 1 times [2020-10-23 18:58:03,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:03,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880798401] [2020-10-23 18:58:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:03,421 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:58:03,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880798401] [2020-10-23 18:58:03,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:03,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:58:03,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341097744] [2020-10-23 18:58:03,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:58:03,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:03,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:58:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:58:03,425 INFO L87 Difference]: Start difference. First operand 853 states and 1028 transitions. Second operand 8 states. [2020-10-23 18:58:03,581 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-23 18:58:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:07,132 INFO L93 Difference]: Finished difference Result 3058 states and 4365 transitions. [2020-10-23 18:58:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 18:58:07,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2020-10-23 18:58:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:07,149 INFO L225 Difference]: With dead ends: 3058 [2020-10-23 18:58:07,149 INFO L226 Difference]: Without dead ends: 2234 [2020-10-23 18:58:07,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:58:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2020-10-23 18:58:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1538. [2020-10-23 18:58:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2020-10-23 18:58:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1920 transitions. [2020-10-23 18:58:07,384 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1920 transitions. Word has length 92 [2020-10-23 18:58:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:07,385 INFO L481 AbstractCegarLoop]: Abstraction has 1538 states and 1920 transitions. [2020-10-23 18:58:07,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:58:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1920 transitions. [2020-10-23 18:58:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-23 18:58:07,388 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:07,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:07,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 18:58:07,388 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:07,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2036460549, now seen corresponding path program 1 times [2020-10-23 18:58:07,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:07,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80737005] [2020-10-23 18:58:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:07,591 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:58:07,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80737005] [2020-10-23 18:58:07,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:07,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:58:07,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188282908] [2020-10-23 18:58:07,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:58:07,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:58:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:58:07,594 INFO L87 Difference]: Start difference. First operand 1538 states and 1920 transitions. Second operand 8 states. [2020-10-23 18:58:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:09,464 INFO L93 Difference]: Finished difference Result 3511 states and 4628 transitions. [2020-10-23 18:58:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 18:58:09,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2020-10-23 18:58:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:09,480 INFO L225 Difference]: With dead ends: 3511 [2020-10-23 18:58:09,480 INFO L226 Difference]: Without dead ends: 2002 [2020-10-23 18:58:09,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:58:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2020-10-23 18:58:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1526. [2020-10-23 18:58:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2020-10-23 18:58:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1898 transitions. [2020-10-23 18:58:09,722 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1898 transitions. Word has length 92 [2020-10-23 18:58:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:09,723 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 1898 transitions. [2020-10-23 18:58:09,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:58:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1898 transitions. [2020-10-23 18:58:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:58:09,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:09,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:09,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 18:58:09,725 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:09,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:09,726 INFO L82 PathProgramCache]: Analyzing trace with hash 950701723, now seen corresponding path program 1 times [2020-10-23 18:58:09,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:09,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740369657] [2020-10-23 18:58:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:10,015 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:58:10,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740369657] [2020-10-23 18:58:10,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:10,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:58:10,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500496715] [2020-10-23 18:58:10,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:58:10,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:58:10,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:58:10,018 INFO L87 Difference]: Start difference. First operand 1526 states and 1898 transitions. Second operand 7 states. [2020-10-23 18:58:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:12,792 INFO L93 Difference]: Finished difference Result 5365 states and 7550 transitions. [2020-10-23 18:58:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:58:12,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2020-10-23 18:58:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:12,823 INFO L225 Difference]: With dead ends: 5365 [2020-10-23 18:58:12,823 INFO L226 Difference]: Without dead ends: 3866 [2020-10-23 18:58:12,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:58:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2020-10-23 18:58:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 3029. [2020-10-23 18:58:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3029 states. [2020-10-23 18:58:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3844 transitions. [2020-10-23 18:58:13,392 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3844 transitions. Word has length 93 [2020-10-23 18:58:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:13,393 INFO L481 AbstractCegarLoop]: Abstraction has 3029 states and 3844 transitions. [2020-10-23 18:58:13,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:58:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3844 transitions. [2020-10-23 18:58:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-10-23 18:58:13,397 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:13,397 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:13,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 18:58:13,398 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash 479079095, now seen corresponding path program 1 times [2020-10-23 18:58:13,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:13,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273579499] [2020-10-23 18:58:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-23 18:58:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-23 18:58:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-23 18:58:13,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273579499] [2020-10-23 18:58:13,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:13,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:58:13,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573883742] [2020-10-23 18:58:13,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:58:13,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:13,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:58:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:58:13,646 INFO L87 Difference]: Start difference. First operand 3029 states and 3844 transitions. Second operand 9 states. [2020-10-23 18:58:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:16,198 INFO L93 Difference]: Finished difference Result 7242 states and 10045 transitions. [2020-10-23 18:58:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:58:16,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2020-10-23 18:58:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:16,231 INFO L225 Difference]: With dead ends: 7242 [2020-10-23 18:58:16,231 INFO L226 Difference]: Without dead ends: 4235 [2020-10-23 18:58:16,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-10-23 18:58:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2020-10-23 18:58:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3183. [2020-10-23 18:58:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2020-10-23 18:58:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4118 transitions. [2020-10-23 18:58:16,845 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4118 transitions. Word has length 114 [2020-10-23 18:58:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:16,845 INFO L481 AbstractCegarLoop]: Abstraction has 3183 states and 4118 transitions. [2020-10-23 18:58:16,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:58:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4118 transitions. [2020-10-23 18:58:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-10-23 18:58:16,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:16,848 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:16,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 18:58:16,848 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1909484935, now seen corresponding path program 1 times [2020-10-23 18:58:16,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:16,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702659079] [2020-10-23 18:58:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:16,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-23 18:58:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-23 18:58:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:58:17,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702659079] [2020-10-23 18:58:17,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:17,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:58:17,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719934728] [2020-10-23 18:58:17,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:58:17,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:58:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:58:17,128 INFO L87 Difference]: Start difference. First operand 3183 states and 4118 transitions. Second operand 10 states. [2020-10-23 18:58:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:24,807 INFO L93 Difference]: Finished difference Result 14667 states and 22560 transitions. [2020-10-23 18:58:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-23 18:58:24,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2020-10-23 18:58:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:24,872 INFO L225 Difference]: With dead ends: 14667 [2020-10-23 18:58:24,872 INFO L226 Difference]: Without dead ends: 8049 [2020-10-23 18:58:24,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 18:58:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8049 states. [2020-10-23 18:58:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8049 to 6251. [2020-10-23 18:58:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6251 states. [2020-10-23 18:58:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6251 states to 6251 states and 8395 transitions. [2020-10-23 18:58:25,983 INFO L78 Accepts]: Start accepts. Automaton has 6251 states and 8395 transitions. Word has length 114 [2020-10-23 18:58:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:25,984 INFO L481 AbstractCegarLoop]: Abstraction has 6251 states and 8395 transitions. [2020-10-23 18:58:25,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:58:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 8395 transitions. [2020-10-23 18:58:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-10-23 18:58:25,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:25,989 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:25,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 18:58:25,990 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:25,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1716439577, now seen corresponding path program 1 times [2020-10-23 18:58:25,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:25,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256406519] [2020-10-23 18:58:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-23 18:58:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-23 18:58:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:58:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,305 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-10-23 18:58:26,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256406519] [2020-10-23 18:58:26,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:26,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:58:26,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647089635] [2020-10-23 18:58:26,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:58:26,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:26,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:58:26,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:58:26,308 INFO L87 Difference]: Start difference. First operand 6251 states and 8395 transitions. Second operand 10 states. [2020-10-23 18:58:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:30,918 INFO L93 Difference]: Finished difference Result 15491 states and 23540 transitions. [2020-10-23 18:58:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 18:58:30,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2020-10-23 18:58:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:30,973 INFO L225 Difference]: With dead ends: 15491 [2020-10-23 18:58:30,973 INFO L226 Difference]: Without dead ends: 9261 [2020-10-23 18:58:31,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:58:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9261 states. [2020-10-23 18:58:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9261 to 8301. [2020-10-23 18:58:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8301 states. [2020-10-23 18:58:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 11325 transitions. [2020-10-23 18:58:32,354 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 11325 transitions. Word has length 157 [2020-10-23 18:58:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:32,354 INFO L481 AbstractCegarLoop]: Abstraction has 8301 states and 11325 transitions. [2020-10-23 18:58:32,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:58:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 11325 transitions. [2020-10-23 18:58:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-10-23 18:58:32,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:32,361 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, 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] [2020-10-23 18:58:32,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 18:58:32,362 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:32,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:32,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1440928313, now seen corresponding path program 1 times [2020-10-23 18:58:32,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:32,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842738072] [2020-10-23 18:58:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-23 18:58:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-23 18:58:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-23 18:58:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:58:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:58:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-10-23 18:58:32,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842738072] [2020-10-23 18:58:32,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589358940] [2020-10-23 18:58:32,686 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:58:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:58:32,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:58:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:58:33,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:58:33,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-10-23 18:58:33,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505546753] [2020-10-23 18:58:33,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:58:33,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:58:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:33,005 INFO L87 Difference]: Start difference. First operand 8301 states and 11325 transitions. Second operand 3 states. [2020-10-23 18:58:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:34,485 INFO L93 Difference]: Finished difference Result 14860 states and 20901 transitions. [2020-10-23 18:58:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:58:34,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2020-10-23 18:58:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:34,534 INFO L225 Difference]: With dead ends: 14860 [2020-10-23 18:58:34,534 INFO L226 Difference]: Without dead ends: 8133 [2020-10-23 18:58:34,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8133 states. [2020-10-23 18:58:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8133 to 7975. [2020-10-23 18:58:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7975 states. [2020-10-23 18:58:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7975 states to 7975 states and 10427 transitions. [2020-10-23 18:58:36,069 INFO L78 Accepts]: Start accepts. Automaton has 7975 states and 10427 transitions. Word has length 164 [2020-10-23 18:58:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:36,070 INFO L481 AbstractCegarLoop]: Abstraction has 7975 states and 10427 transitions. [2020-10-23 18:58:36,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:58:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7975 states and 10427 transitions. [2020-10-23 18:58:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-23 18:58:36,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:36,079 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:36,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-23 18:58:36,293 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:36,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:36,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1750641979, now seen corresponding path program 1 times [2020-10-23 18:58:36,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:36,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258055096] [2020-10-23 18:58:36,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-23 18:58:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-23 18:58:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-23 18:58:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-10-23 18:58:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-10-23 18:58:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:58:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-10-23 18:58:36,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258055096] [2020-10-23 18:58:36,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917123596] [2020-10-23 18:58:36,872 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:58:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-23 18:58:37,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:58:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-23 18:58:37,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:58:37,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-10-23 18:58:37,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281121490] [2020-10-23 18:58:37,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:58:37,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:58:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:37,142 INFO L87 Difference]: Start difference. First operand 7975 states and 10427 transitions. Second operand 3 states. [2020-10-23 18:58:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:38,355 INFO L93 Difference]: Finished difference Result 13594 states and 18656 transitions. [2020-10-23 18:58:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:58:38,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2020-10-23 18:58:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:38,392 INFO L225 Difference]: With dead ends: 13594 [2020-10-23 18:58:38,392 INFO L226 Difference]: Without dead ends: 7975 [2020-10-23 18:58:38,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states. [2020-10-23 18:58:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 7892. [2020-10-23 18:58:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7892 states. [2020-10-23 18:58:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 10082 transitions. [2020-10-23 18:58:40,009 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 10082 transitions. Word has length 207 [2020-10-23 18:58:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:40,010 INFO L481 AbstractCegarLoop]: Abstraction has 7892 states and 10082 transitions. [2020-10-23 18:58:40,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:58:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 10082 transitions. [2020-10-23 18:58:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-10-23 18:58:40,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:40,019 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:40,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-23 18:58:40,235 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:40,236 INFO L82 PathProgramCache]: Analyzing trace with hash 251615912, now seen corresponding path program 1 times [2020-10-23 18:58:40,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:40,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268511039] [2020-10-23 18:58:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:58:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-10-23 18:58:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-23 18:58:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-23 18:58:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-10-23 18:58:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-23 18:58:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-10-23 18:58:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-10-23 18:58:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:58:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-10-23 18:58:40,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268511039] [2020-10-23 18:58:40,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:40,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 18:58:40,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768670311] [2020-10-23 18:58:40,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:58:40,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:58:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:40,623 INFO L87 Difference]: Start difference. First operand 7892 states and 10082 transitions. Second operand 11 states. [2020-10-23 18:58:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:44,269 INFO L93 Difference]: Finished difference Result 15012 states and 20066 transitions. [2020-10-23 18:58:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 18:58:44,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 208 [2020-10-23 18:58:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:44,290 INFO L225 Difference]: With dead ends: 15012 [2020-10-23 18:58:44,290 INFO L226 Difference]: Without dead ends: 3207 [2020-10-23 18:58:44,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2020-10-23 18:58:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2020-10-23 18:58:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3024. [2020-10-23 18:58:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2020-10-23 18:58:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 3513 transitions. [2020-10-23 18:58:44,841 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 3513 transitions. Word has length 208 [2020-10-23 18:58:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:44,842 INFO L481 AbstractCegarLoop]: Abstraction has 3024 states and 3513 transitions. [2020-10-23 18:58:44,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:58:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3513 transitions. [2020-10-23 18:58:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-10-23 18:58:44,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:44,848 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:44,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 18:58:44,848 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -287072908, now seen corresponding path program 1 times [2020-10-23 18:58:44,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:44,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293921797] [2020-10-23 18:58:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:58:44,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:58:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:58:44,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:58:45,027 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:58:45,028 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:58:45,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 18:58:45,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:58:45 BoogieIcfgContainer [2020-10-23 18:58:45,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:58:45,211 INFO L168 Benchmark]: Toolchain (without parser) took 71577.99 ms. Allocated memory was 152.0 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 127.8 MB in the beginning and 967.3 MB in the end (delta: -839.5 MB). Peak memory consumption was 722.5 MB. Max. memory is 8.0 GB. [2020-10-23 18:58:45,212 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 152.0 MB. Free memory is still 126.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:58:45,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.89 ms. Allocated memory is still 152.0 MB. Free memory was 127.2 MB in the beginning and 113.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:58:45,213 INFO L168 Benchmark]: Boogie Preprocessor took 108.34 ms. Allocated memory is still 152.0 MB. Free memory was 113.8 MB in the beginning and 111.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:58:45,214 INFO L168 Benchmark]: RCFGBuilder took 842.48 ms. Allocated memory is still 152.0 MB. Free memory was 111.5 MB in the beginning and 117.1 MB in the end (delta: -5.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:58:45,214 INFO L168 Benchmark]: TraceAbstraction took 70025.00 ms. Allocated memory was 152.0 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 116.5 MB in the beginning and 967.3 MB in the end (delta: -850.8 MB). Peak memory consumption was 710.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:58:45,217 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.18 ms. Allocated memory is still 152.0 MB. Free memory is still 126.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 587.89 ms. Allocated memory is still 152.0 MB. Free memory was 127.2 MB in the beginning and 113.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 108.34 ms. Allocated memory is still 152.0 MB. Free memory was 113.8 MB in the beginning and 111.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 842.48 ms. Allocated memory is still 152.0 MB. Free memory was 111.5 MB in the beginning and 117.1 MB in the end (delta: -5.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 70025.00 ms. Allocated memory was 152.0 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 116.5 MB in the beginning and 967.3 MB in the end (delta: -850.8 MB). Peak memory consumption was 710.6 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: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int m_i ; [L24] int t1_i ; [L25] int t2_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; VAL [\old(E_1)=70, \old(E_2)=53, \old(M_E)=67, \old(m_i)=54, \old(m_pc)=62, \old(m_st)=60, \old(T1_E)=50, \old(t1_i)=68, \old(t1_pc)=57, \old(t1_st)=51, \old(T2_E)=65, \old(t2_i)=55, \old(t2_pc)=56, \old(t2_st)=59, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L565] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L569] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L479] m_i = 1 [L480] t1_i = 1 [L481] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L569] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L570] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L506] int kernel_st ; [L507] int tmp ; [L508] int tmp___0 ; [L512] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L513] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L514] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L213] COND TRUE m_i == 1 [L214] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L218] COND TRUE t1_i == 1 [L219] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L223] COND TRUE t2_i == 1 [L224] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L514] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L515] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L326] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L331] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L336] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L341] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L346] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L515] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L516] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L395] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L145] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L148] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L160] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L395] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_master_triggered()=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L403] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L164] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L167] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L179] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit1_triggered()=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L411] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L183] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L186] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L198] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit2_triggered()=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L516] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L517] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L359] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L364] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L369] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L374] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L379] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L517] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L520] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L259] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L263] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L266] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L233] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L254] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L266] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L293] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L80] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L293] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2] [L307] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L115] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L128] t2_pc = 1 [L129] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L307] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2] [L263] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2] [L266] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L233] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L236] COND TRUE m_st == 0 [L237] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L254] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L266] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2] [L266] tmp = exists_runnable_thread() [L268] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2] [L273] COND TRUE m_st == 0 [L274] int tmp_ndt_1; [L275] tmp_ndt_1 = __VERIFIER_nondet_int() [L276] COND TRUE \read(tmp_ndt_1) [L278] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-1, tmp_ndt_3=-2] [L279] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L39] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L50] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L54] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L427] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L145] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_master_triggered()=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L403] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND TRUE E_1 == 1 [L169] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND TRUE \read(tmp___0) [L406] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L411] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit2_triggered()=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L411] tmp___1 = is_transmit2_triggered() [L413] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L427] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L54] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L55] E_1 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L60] m_pc = 1 [L61] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L279] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-1, tmp_ndt_3=-2] [L287] COND TRUE t1_st == 0 [L288] int tmp_ndt_2; [L289] tmp_ndt_2 = __VERIFIER_nondet_int() [L290] COND TRUE \read(tmp_ndt_2) [L292] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=-2] [L293] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L80] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L83] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L99] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L100] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L427] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L389] int tmp ; [L390] int tmp___0 ; [L391] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L145] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L148] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L149] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L160] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_master_triggered()=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L395] tmp = is_master_triggered() [L397] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L403] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L164] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L179] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit1_triggered()=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L403] tmp___0 = is_transmit1_triggered() [L405] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L411] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L183] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] COND TRUE E_2 == 1 [L188] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L198] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit2_triggered()=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L411] tmp___1 = is_transmit2_triggered() [L413] COND TRUE \read(tmp___1) [L414] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L427] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L100] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L93] t1_pc = 1 [L94] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L293] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=-2] [L301] COND TRUE t2_st == 0 [L302] int tmp_ndt_3; [L303] tmp_ndt_3 = __VERIFIER_nondet_int() [L304] COND TRUE \read(tmp_ndt_3) [L306] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=-4] [L307] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L115] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L118] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L134] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L13] CALL reach_error() VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L3] __assert_fail("0", "transmitter.02.cil.c", 3, "reach_error") VAL [\old(E_1)=2, \old(E_2)=2, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 173 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 69.7s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 53.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3136 SDtfs, 11351 SDslu, 1048 SDs, 0 SdLazy, 16755 SolverSat, 5977 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8301occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 7846 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2411 ConstructedInterpolants, 0 QuantifiedInterpolants, 780355 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1641 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 513/524 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...